CPM reception combining complexity reduction techniques for schemes on minimum Euclidian distance upper bound and MSK
Monteiro, F. A.
Rodrigues, A. J.
CPM reception combining complexity reduction techniques for schemes on minimum Euclidian distance upper bound and MSK, Proc IEEE Symp. on Information Theory, Chicago, United States, Vol. I, pp. 218 - 218, June, 2004.
Digital Object Identifier: 10.1109/ISIT.2004.1365257
Download Full text PDF ( 83 KBs)
The paper shows that some continuous phase modulation (CPM) schemes have some properties that allow a near optimum reception with very low complexity. The proposed reception method applies simultaneously three techniques for complexity reduction of CPM receivers, which have been previously object of separate analysis with additive white Gaussian noise (AWGN). These techniques are: first-quadrant metrics calculus on a F-dimensional Walsh space, derivation of the other quadrant metrics using a no loss derivation algorithm and finally the use of constrained complexity maximum likelihood sequence detection (MLSD) using the M-algorithm. The cumulative effect on total performance loss is negligible and no more than the sum of the partial losses due to the Walsh space and the M-algorithm, known to be negligible when observing the respective standalone rules for the complexity reduction limits.