Near-Capacity Iteratively Decoded Binary Self-Concatenated Code Design Using EXIT Charts

In this treatise extrinsic information transfer (EXIT) charts are used to design binary self-concatenated convolutional codes employing iterative decoding (SECCC-ID) for communicating over both uncorrelated Rayleigh fading and additive white Gaussian noise (AWGN) channels. Recursive Systematic Convolutional (RSC) codes are selected as constituent codes, an interleaver is used for randomising the extrinsic information exchange of the constituent codes, while a puncturer assists us in increasing the achievable bandwidth efficiency. At the receiver, self-iterative decoding is invoked for exchanging extrinsic information between the hypothetical decoder components. The convergence behaviour of the decoder is analysed with the aid of bit-based EXIT charts. Finally, we propose an attractive system configuration, which is capable of operating within about 1 dB of the information-theoretic limits.

[1]  Stephan ten Brink,et al.  Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..

[2]  Dariush Divsalar,et al.  Self-concatenated trellis coded modulation with self-iterative decoding , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

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

[4]  Hans-Andrea Loeliger.  New turbo-like codes , 1997, Proceedings of IEEE International Symposium on Information Theory.

[5]  G. David Forney,et al.  Concatenated codes , 2009, Scholarpedia.

[6]  Lajos Hanzo,et al.  EXIT Chart Aided Design of Near-Capacity Self-Concatenated Trellis Coded Modulation Using Iterative Decoding , 2008, VTC Spring 2008 - IEEE Vehicular Technology Conference.

[7]  Soon Xin Ng,et al.  Quadrature Amplitude Modulation: From Basics to Adaptive Trellis-Coded, Turbo-Equalised and Space-Time Coded OFDM, CDMA and MC-CDMA Systems , 2004 .

[8]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[9]  A. Grant,et al.  Convergence of non-binary iterative decoding , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[10]  Alexander M. Haimovich,et al.  EXIT charts for turbo trellis-coded modulation , 2004, IEEE Communications Letters.

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

[12]  Joachim Hagenauer,et al.  Rate-compatible punctured convolutional codes (RCPC codes) and their applications , 1988, IEEE Trans. Commun..

[13]  Dariush Divsalar,et al.  Serial concatenated trellis coded modulation with iterative decoding , 1997, Proceedings of IEEE International Symposium on Information Theory.

[14]  Lajos Hanzo,et al.  Near-Capacity Iteratively Decoded Space-Time Block Coding , 2008, VTC Spring 2008 - IEEE Vehicular Technology Conference.

[15]  P. Robertson,et al.  Coded modulation scheme employing turbo codes , 1995 .

[16]  Lajos Hanzo,et al.  Efficient Computation of EXIT Functions for Nonbinary Iterative Decoding , 2006, IEEE Transactions on Communications.

[17]  Sergio Benedetto,et al.  Convergence properties of iterative decoders working at bit and symbol level , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[18]  A. Glavieux,et al.  Turbo-codes and high spectral efficiency modulation , 1994, Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications.

[19]  Dariush Divsalar,et al.  Bandwidth efficient parallel concatenated coding schemes , 1995 .