Symbol-by-symbol MAP demodulation of CPM and PSK signals on Rayleigh flat-fading channels

Demodulation using the symbol-by-symbol maximum a posteriori probability (MAP) algorithm is presented, The algorithm is derived for the case of continuous phase modulation (CPM) signals transmitted over Rayleigh flat-fading channels, and a corresponding receiver structure is specified, It is shown that the MAP algorithm requires computing, for each trellis branch, the sum of the products of the weights of all paths through the trellis which pass through that branch, and that this generic computational problem can be solved efficiently by an approach that uses a forward and backward recursion through the trellis, Simulation results are presented which show both the hard and soft decision performance of the MAP receiver to be robust, even in the presence of fade rates of up to 30% of the symbol rate. The application of the receiver concept to phase-shift keying (PSK) signals is also discussed, and then evaluated via simulation, The concept of joint demodulation and decoding using iterative processing techniques is introduced, It is shown that the MAP receiver is well suited for iterative processing applications due to its use of a priori symbol probabilities and its production of optimal soft decisions, Simulation results for the reception of quaternary PSK (QPSK) show that the bit error rate (BER) performance of the iterative MAP receiver can approach that of a receiver operating with perfect knowledge of the fading process.