Το work with title GLRT-optimal blind MSK detection with log-linear complexity by Fountzoulas Ioannis, Chachlakis Dimitrios, Karystinos Georgios, Bletsas Aggelos is licensed under Creative Commons Attribution 4.0 International
Bibliographic Citation
Y. Fountzoulas, D. Chachlakis, G. N. Karystinos and A. Bletsas, "GLRT-optimal blind MSK detection with log-linear complexity," in 23rd International Conference on Telecommunications, 2016. doi: 10.1109/ICT.2016.7500403
https://doi.org/10.1109/ICT.2016.7500403
Minimum-shift keying (MSK) limits problems associated with nonlinear distortion and is used in a variety of applications, like signal transmission from satellites and broadcasting. Although the optimal coherent MSK receiver simplifies to constant-complexity symbol-by-symbol detection, optimal blind reception of MSK takes the form of sequence detection (due to channel-induced memory) which has exponential (in the sequence length) complexity when implemented through an exhaustive search among all possible sequences. In this work, we present an algorithm that performs generalized-likelihood-ratio-test (GLRT) optimal blind sequence detection of MSK signals in flat fading with log-linear (in the sequence length) complexity. Moreover, for Rayleigh fading channels, the proposed algorithm is equivalent to the maximum-likelihood (ML) blind sequence detector. Simulation studies indicate that the optimal blind MSK detector attains coherent-detection performance when the sequence length is on the order of 100, offering a 5-6 dB gain over the typical single-symbol detector.