An overview of turbo codes and their applications

More than ten years after their introduction, turbo Codes are now a mature technology that has been rapidly adopted for application in many commercial transmissions systems. This paper provides an overview of the basic concepts employed in convolutional and block turbo codes, and review the major evolutions in the field with an emphasis on practical issues such as implementation complexity and high-rate circuit architectures. We address the use of these technologies in existing standards and also discuss future potential applications for this error-control coding technology

[1]  Dariush Divsalar,et al.  Code Performance as a Function of Block Size , 1998 .

[2]  Claude Berrou,et al.  Multiple parallel concatenation of circular recursive systematic convolutional (Crsc) codes , 1999, Ann. des Télécommunications.

[3]  Paul Guinand,et al.  Distance upper bounds and true minimum distance results for turbo-codes designed with DRP interleavers , 2005, Ann. des Télécommunications.

[4]  Claude Berrou,et al.  Computing the minimum distance of linear codes by the error impulse method , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[5]  Joachim Hagenauer,et al.  A Viterbi algorithm with soft-decision outputs and its applications , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

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

[7]  Claude Berrou,et al.  The advantages of non-binary turbo codes , 2001, Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494).

[8]  Roberto Garello,et al.  Computing the free distance of turbo codes and serially concatenated codes with interleavers: algorithms and applications , 2001, IEEE J. Sel. Areas Commun..

[9]  Claude Berrou,et al.  Turbo codes with rate-m/(m+1) constituent convolutional codes , 2005, IEEE Transactions on Communications.

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

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

[12]  Ramesh Pyndiah,et al.  New architecture for high data rate turbo decoding of product codes , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

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

[14]  Fabrizio Pollara,et al.  Stopping Rules for Turbo Decoders , 2000 .

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

[16]  Ramesh Pyndiah,et al.  Near-optimum decoding of product codes: block turbo codes , 1998, IEEE Trans. Commun..

[17]  Claude Berrou,et al.  Designing good permutations for turbo codes: towards a single model , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[18]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

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

[20]  Sergio Benedetto,et al.  A soft-input soft-output maximum a posteriori (MAP) module to decode parallel and serial concatenated codes , 1996 .

[21]  C. Berrou,et al.  Computing the minimum distances of linear codes by the error impulse method , 2002, Proceedings IEEE International Symposium on Information Theory,.

[22]  David Chase,et al.  Class of algorithms for decoding block codes with channel measurement information , 1972, IEEE Trans. Inf. Theory.

[23]  S. Dolinar,et al.  Weight distributions for turbo codes using random and nonrandom permutations , 1995 .

[24]  Gérard Battail.  Coding for the Gaussian channel - The promise of weighted-output decoding , 1989 .

[25]  R. Pyndiah,et al.  Reliable transmission with low complexity Reed-Solomon block turbo codes , 2004, 1st International Symposium onWireless Communication Systems, 2004..

[26]  R. Pyndiah,et al.  Potential applications of low complexity non-binary high code rate block turbo codes , 2004, IEEE MILCOM 2004. Military Communications Conference, 2004..

[27]  F. Pollara,et al.  Serial concatenation of interleaved codes: performance analysis, design and iterative decoding , 1996, Proceedings of IEEE International Symposium on Information Theory.

[28]  Peter Elias,et al.  Error-free Coding , 1954, Trans. IRE Prof. Group Inf. Theory.

[29]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.