A Comparison of Optimal and Sub-optimal Iterative Equalization Techniques for Full-response CPM

Conference: TURBO - CODING - 2006 - 4th International Symposium on Turbo Codes & Related Topics; 6th International ITG-Conference on Source and Channel Coding
04/03/2006 - 04/07/2006 at Munich, Germany

Proceedings: TURBO - CODING - 2006

Pages: 6Language: englishTyp: PDF

Personal VDE Members are entitled to a 10% discount on this title

Anderson, Michael; Borg, Gerard (Research School of Physical Sciences and Engineering, Australian National University, Canberra, ACT 0200, Australia)
Reed, Mark C. (National ICT Australia, The Australian National University, Canberra, ACT 0200, Australia)

It is well known that continuous phase modulation (CPM) serially concatenated with convolutional codes provides powerful error correction through iterative decoding. CPM also has the inherent benefits of being bandwidth efficient and compatible with non-linear amplifiers. A disadvantage of CPM is its relatively poor performance over ISI channels. In this paper we compare two methods of iteratively equalizing CPM. The first is the optimal method that combines the memory of the CPM with the memory of the channel such that decoding is performed over the resulting “super-trellis”. The second method is the interference cancellation method using the Laurent signal model. The two methods are compared through Monte Carlo simulations and EXIT chart analysis.