Sequential Change Point Detection for PSK Modulation Switching
Abstract
Transmitters in adaptive communication systems may switch their modulation scheme at an unknown time, and a receiver must detect this switch quickly without raising frequent false alarms. Existing modulation classification methods label a finite block of received data and do not provide stopping rules with controlled false-alarm and delay performance. We study the sequential detection of a switch from one phase shift keying (PSK) scheme to another over an additive white Gaussian noise channel. We build cumulative-sum (CUSUM) and moving-sum (MOSUM) detectors from the log-likelihood ratio and its low-SNR approximation. For a switch from quadrature PSK to binary PSK, we derive the moment-generating function and probability density function of the approximate statistic. We use them to relate the CUSUM threshold to the average run length to false alarm and the worst-case detection delay. For a switch between any two PSK orders, we approximate the vector of overlapping MOSUM statistics as multivariate Gaussian and obtain bounds on both measures. Monte Carlo simulations show that our derived expressions for ARL2FA and WADD closely match the empirical results across thresholds, validating the accuracy of the proposed analytical approximations and theoretical bounds.
Related
- Generalized Stochastic Approximation of the Log-Likelihood Ratio for Robust Sequential Change-Point Detection
- Truncated sequential change-point detection for Markov chains with applications in the epidemic statistical analysis
- Extreme change-point detection
- Nonparametric Change-Point Detection and Inference for High-Dimensional Distributions
- Change-point detection in variance-covariance matrix
BibTeX
@misc{kataria2026sequential,
title = {{Sequential Change Point Detection for PSK Modulation Switching}},
author = {Gopal Kataria and Davin Sequeira and Arti Yardi},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.14208},
eprint = {2610.14208},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.14208},
}
RIS
TY - UNPB
TI - Sequential Change Point Detection for PSK Modulation Switching
AU - Gopal Kataria
AU - Davin Sequeira
AU - Arti Yardi
PY - 2026
DA - 2026/10/09
PB - arXiv
DO - 10.48550/arxiv.2610.14208
UR - https://arxiv.org/abs/2610.14208
AB - Transmitters in adaptive communication systems may switch their modulation scheme at an unknown time, and a receiver must detect this switch quickly without raising frequent false alarms. Existing modulation classification methods label a finite block of received data and do not provide stopping rules with controlled false-alarm and delay performance. We study the sequential detection of a switch from one phase shift keying (PSK) scheme to another over an additive white Gaussian noise channel. We build cumulative-sum (CUSUM) and moving-sum (MOSUM) detectors from the log-likelihood ratio and its low-SNR approximation. For a switch from quadrature PSK to binary PSK, we derive the moment-generating function and probability density function of the approximate statistic. We use them to relate the CUSUM threshold to the average run length to false alarm and the worst-case detection delay. For a switch between any two PSK orders, we approximate the vector of overlapping MOSUM statistics as multivariate Gaussian and obtain bounds on both measures. Monte Carlo simulations show that our derived expressions for ARL2FA and WADD closely match the empirical results across thresholds, validating the accuracy of the proposed analytical approximations and theoretical bounds.
ER -