BCE and PCE Performance

In this chapter we identify the structural characteristics of Binary Convolutional Encoders (BCE’s) and Parallel Concatenated Encoders (PCE’s) that determine their error control performance. It will be shown that one important factor for PCE performance is the spar-sity of codewords at weights near the free Hamming distance. Another is the manner in which information sequences are mapped to code or parity sequences. An analytic framework is provided for performance analyses over the Additive White Gaussian Noise (AWGN) channel. This framework can only provide performance bounds — an exact performance analysis has not yet been devised. The bounds are useful, however, both for conceptual and design purposes. For example, the bounds indicate that the size of the PCE interleaver is an important contributor to performance when the component encoders are systematic IIR BCE’s. This inference is readily verified through simulations.

[1]  Andrew J. Viterbi,et al.  Convolutional Codes and Their Performance in Communication Systems , 1971 .

[2]  D. Divsalar,et al.  Multiple turbo codes for deep-space communications , 1995 .

[3]  Andrew J. Viterbi,et al.  Principles of Digital Communication and Coding , 1979 .

[4]  G. David Forney,et al.  Geometrically uniform codes , 1991, IEEE Trans. Inf. Theory.

[5]  S. Wicker Error Control Systems for Digital Communication and Storage , 1994 .

[6]  D. Slepian Group codes for the Gaussian channel , 1968 .

[7]  Dariush Divsalar,et al.  Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding , 1997, IEEE Trans. Inf. Theory.

[8]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[9]  Alain Glavieux,et al.  Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes" , 1998 .

[10]  Sergio Benedetto,et al.  Design of parallel concatenated convolutional codes , 1996, IEEE Trans. Commun..

[11]  Daniel J. Costello Free distance bounds for convolutional codes , 1974, IEEE Trans. Inf. Theory.

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

[13]  Patrick Robertson,et al.  Illuminating the structure of code and decoder of parallel concatenated recursive systematic (turbo) codes , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[14]  Daniel J. Costello,et al.  A distance spectrum interpretation of turbo codes , 1996, IEEE Trans. Inf. Theory.

[15]  Stephen B. Wicker,et al.  Applications of Error-Control Coding , 1998, IEEE Trans. Inf. Theory.

[16]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[17]  Sergio Benedetto,et al.  Unveiling turbo codes: some results on parallel concatenated coding schemes , 1996, IEEE Trans. Inf. Theory.

[18]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[19]  R. McEliece,et al.  Effective free distance of turbo codes , 1996 .

[20]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[21]  Joachim Hagenauer,et al.  Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.