Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes"

This paper presents a new family of convolutional codes, nicknamed turbo-codes, built from a particular concatenation of two recursive systematic codes, linked together by nonuniform interleaving. Decoding calls on iterative processing in which each component decoder takes advantage of the work of the other at the previous step, with the aid of the original concept of extrinsic information. For sufficiently large interleaving sizes, the correcting performance of turbo-codes, investigated by simulation, appears to be close to the theoretical limit predicted by Shannon.

[1]  Punya Thitimajshima.  Les codes convolutifs récursifs systématiques et leurs applications à la concatenation parallèle , 1993 .

[2]  Peter Adam Hoeher,et al.  Separable MAP "filters" for the decoding of product and concatenated codes , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[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]  Yasuo Hirata,et al.  High-Rate Punctured Convolutional Codes for Soft Decision Viterbi Decoding , 1984, IEEE Trans. Commun..

[5]  Ramesh Pyndiah,et al.  Near optimum decoding of product codes , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[6]  Patrick Robertson,et al.  Optimal and sub-optimal maximum a posteriori algorithms suitable for turbo decoding , 1997, Eur. Trans. Telecommun..

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

[8]  Gottfried Ungerboeck,et al.  Channel coding with multilevel/phase signals , 1982, IEEE Trans. Inf. Theory.

[9]  J. Bibb Cain,et al.  Punctured convolutional codes of rate (n-1)/n and simplified maximum likelihood decoding (Corresp.) , 1979, IEEE Trans. Inf. Theory.

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

[11]  S. S. Pietrobon,et al.  A Simplification of the Modified Bahl Decoding Algorithm for Systematic Convolutional Codes , 1994 .

[12]  Rolf Johannesson,et al.  A fast algorithm for computing distance spectrum of convolutional codes , 1989, IEEE Trans. Inf. Theory.

[13]  Alain Glavieux,et al.  Iterative correction of intersymbol interference: Turbo-equalization , 1995, Eur. Trans. Telecommun..

[14]  E. Dunscombe,et al.  Optimal interleaving scheme for convolutional coding , 1989 .

[15]  D. Graupe,et al.  Punctured Convolutional Codes of Rate (n - 1)/n and Simplified Maximum Likelihood Decoding , 1979 .