Parallel concatenated turbo codes for continuous phase modulation

There are several ways to use iterative decoding techniques with coded continuous phase modulation (CPM). This paper presents a method using parallel concatenation of convolutionally-coded CPM. All CPM schemes can be decomposed into a ring convolutional code and a memoryless signal mapper. This allows a properly designed convolutional code trellis to be combined with the CPM trellis, producing the joint trellis of a constituent code. Parallel concatenation of such constituent codes combined with iterative decoding yields very good performance. We present the results of code searches for two binary CPM schemes, each using bit interleaving and symbol interleaving. Simulation results using various length interleavers are also provided. Low complexity encoders are shown to perform better using bit interleaving, whereas encoders with higher complexity perform better with symbol interleaving.

[1]  Rodger E. Ziemer,et al.  Principles of communications , 1976 .

[2]  Richard D. Wesel,et al.  Symbol interleaved parallel concatenated trellis coded modulation , 1999, 1999 IEEE Communications Theory Mini-Conference (Cat. No.99EX352).

[3]  G. David Forney,et al.  Convolutional codes I: Algebraic structure , 1970, IEEE Trans. Inf. Theory.

[4]  Richard D. Wesel,et al.  Turbo-encoder design for symbol-interleaved parallel concatenated trellis-coded modulation , 2001, IEEE Trans. Commun..

[5]  I. M. Jacobs,et al.  Principles of Communication Engineering , 1965 .

[6]  David Lee,et al.  Conformance testing of protocols specified as communicating finite state machines-a guided random walk based approach , 1996, IEEE Trans. Commun..

[7]  Krishna R. Narayanan,et al.  Low complexity turbo equalization with binary precoding , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[8]  Ezio Biglieri,et al.  Suboptimum detection of trellis-coded CPM for transmission on bandwidth- and power-limited channels , 1991, IEEE Trans. Commun..

[9]  Bixio Rimoldi,et al.  Coded continuous phase modulation using ring convolutional codes , 1995, IEEE Trans. Commun..

[10]  Krishna R. Narayanan.  Iterative demodulation and decoding of trellis coded CPM , 1999, MILCOM 1999. IEEE Military Communications. Conference Proceedings (Cat. No.99CH36341).

[11]  Dariush Divsalar,et al.  A soft-input soft-output APP module for iterative decoding of concatenated codes , 1997, IEEE Communications Letters.

[12]  Subbarayan Pasupathy,et al.  Iterative decoding of serially concatenated convolutional codes and MSK , 1999, IEEE Communications Letters.

[13]  Bixio Rimoldi,et al.  A decomposition approach to CPM , 1988, IEEE Trans. Inf. Theory.

[14]  Tor Aulin,et al.  Digital Phase Modulation , 1986, Applications of Communications Theory.

[15]  Bixio Rimoldi,et al.  Design of coded CPFSK modulation systems for bandwidth and energy efficiency , 1989, IEEE Trans. Commun..

[16]  Desmond P. Taylor,et al.  Trellis-coded continuous-phase frequency-shift keying with ring convolutional codes , 1994, IEEE Trans. Inf. Theory.

[17]  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.

[18]  Peter J. McLane,et al.  Coherent detection of interleaved trellis encoded CPFSK on shadowed mobile satellite channels , 1992 .

[19]  Dariush Divsalar,et al.  Multiple symbol trellis coding of CPFSK , 1996, IEEE Trans. Commun..

[20]  Roberto Garello,et al.  A search for good convolutional codes to be used in the construction of turbo codes , 1998, IEEE Trans. Commun..

[21]  Christophe Brutel,et al.  Serial concatenation of interleaved convolutional codes andM-ary continuous phase modulations , 1999 .