Convergence analysis of SCCPM with iterative decoding

A convergence analysis of serially concatenated continuous phase modulation (SCCPM) with iterative decoding is presented, based on extrinsic information density evolution. Earlier conclusions from union bounds to maximum likelihood decoding that could not be verified by simulations can now be explained. This includes the effect of more complex outer codes and of inner CPM systems with input weight 1 error events. Due to their trivial feed-forward polynomial, all CPM systems provide good initial decoder convergence. Still the role of the CPM state complexity is not well explained. Finally, bit error rate performance per iteration is estimated from the diagrams, showing good coherence with simulation results.

[1]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[2]  Joseph Jean Boutros,et al.  Serial concatenation of interleaved convolutional codes and M -ary continuous phase modulations - Concaténation série de codes convolutifs et de modulations à phase continue m -aires séparés par un entrelaceur , 1999, Ann. des Télécommunications.

[3]  G.L. Stuber,et al.  Performance of trellis coded CPM with iterative demodulation and decoding , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[4]  Pär Moqvist,et al.  Serially concatenated systems : an iterative coding approach with application to continuous phase modulation , 1999 .

[5]  S. Brink.  Convergence of iterative decoding , 1999 .

[6]  Evaggelos Geraniotis,et al.  On the theory and application of space-time and graph-based codes , 1999 .

[7]  S. Dolinar,et al.  Iterative turbo decoder analysis based on Gaussian density evolution , 2000, MILCOM 2000 Proceedings. 21st Century Military Communications. Architectures and Technologies for Information Superiority (Cat. No.00CH37155).

[8]  Tor Aulin,et al.  Power and bandwidth efficient serially concatenated CPM with iterative decoding , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[9]  Tor Aulin,et al.  Trellis termination in CPM , 2000 .

[10]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[11]  Tor Aulin,et al.  Serially concatenated continuous phase modulation with iterative decoding , 2001, IEEE Trans. Commun..

[12]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.