Turbo and Turbo-Like Codes: Principles and Applications in Telecommunications

For decades, the de facto standard for forward error correction was a convolutional code decoded with the Viterbi algorithm, often concatenated with another code (e.g., a Reed-Solomon code). But since the introduction of turbo codes in 1993, much more powerful codes referred to collectively as turbo and turbo-like codes have eclipsed classical methods. These powerful error-correcting techniques achieve excellent error-rate performance that can closely approach Shannon's channel capacity limit. The lure of these large coding gains has resulted in their incorporation into a widening array of telecommunications standards and systems. This paper will briefly characterize turbo and turbo-like codes, examine their implications for physical layer system design, and discuss standards and systems where they are being used. The emphasis will be on telecommunications applications, particularly wireless, though others are mentioned. Some thoughts on the use of turbo and turbo-like codes in the future will also be given.

[1]  Roberto Garello,et al.  MHOMS: high-speed ACM modem for satellite applications , 2005, IEEE Wireless Communications.

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

[3]  Gordon L. Stüber,et al.  Selective serial concatenation of turbo codes , 1997, IEEE Communications Letters.

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

[5]  Bahram Honary,et al.  Fast Chase algorithm with an application in turbo decoding , 2001, IEEE Trans. Commun..

[6]  Hyuncheol Park,et al.  Modified UMP-BP decoding algorithm based on mean square error , 2004 .

[7]  Alberto Morello,et al.  DVB-S2: The Second Generation Standard for Satellite Broad-Band Services , 2006, Proceedings of the IEEE.

[8]  M. Luby,et al.  Improved low-density parity-check codes using irregular graphs and belief propagation , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[9]  A. J. Blanksby,et al.  A 690-mW 1-Gb/s 1024-b, rate-1/2 low-density parity-check code decoder , 2001, IEEE J. Solid State Circuits.

[10]  Dana Mackenzie Take it to the limit , 2005 .

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

[12]  Dariush Divsalar,et al.  Multiple turbo codes , 1995, Proceedings of MILCOM '95.

[13]  Miguel R. D. Rodrigues,et al.  Can Punctured Rate-1/2 Turbo Codes Achieve a Lower Error Floor than their Rate-1/3 Parent Codes? , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Chengdu.

[14]  Marc P. C. Fossorier,et al.  Shuffled iterative decoding , 2005, IEEE Transactions on Communications.

[15]  Nenad Miladinovic,et al.  Generalized LDPC codes with Reed-Solomon and BCH codes as component codes for binary channels , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

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

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

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

[19]  Dariush Divsalar,et al.  Iterative turbo decoder analysis based on density evolution , 2001, IEEE J. Sel. Areas Commun..

[20]  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).

[21]  Peter A. Hoeher,et al.  Optimal subblock-by-subblock detection , 1995, IEEE Trans. Commun..

[22]  Paul Guinand,et al.  Estimating the minimum distance of large-block turbo codes using iterative multiple-impulse methods , 2007, Eur. Trans. Telecommun..

[23]  Michael Moher,et al.  An iterative multiuser decoder for near-capacity communications , 1998, IEEE Trans. Commun..

[24]  Jian Sun,et al.  The UMTS Turbo Code and an Efficient Decoder Implementation Suitable for Software-Defined Radios , 2001, Int. J. Wirel. Inf. Networks.

[25]  Iryna Andriyanova,et al.  A new family of codes with high iterative decoding performances , 2006, 2006 IEEE International Conference on Communications.

[26]  Jinghu Chen,et al.  Near optimum universal belief propagation based decoding of low-density parity check codes , 2002, IEEE Trans. Commun..

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

[28]  J. Villasenor,et al.  Approximate-MIN constraint node updating for LDPC code decoding , 2003, IEEE Military Communications Conference, 2003. MILCOM 2003..

[29]  David J. C. MacKay,et al.  Comparison of constructions of irregular Gallager codes , 1999, IEEE Trans. Commun..

[30]  K. Chugg,et al.  New class of turbo-like codes with universally good performance and high-speed decoding , 2005, MILCOM 2005 - 2005 IEEE Military Communications Conference.

[31]  E. Papagiannis,et al.  Approaching the ML performance with iterative decoding , 2004, International Zurich Seminar on Communications, 2004.

[32]  Dariush Divsalar,et al.  Coding theorems for 'turbo-like' codes , 1998 .

[33]  Youssouf Ould-Cheikh-Mouhamedou,et al.  A Method for Lowering Turbo Code Error Flare using Correction Impulses and Repeated Decoding , 2006 .

[34]  Niclas Wiberg,et al.  Codes and Decoding on General Graphs , 1996 .

[35]  Dale E. Hocevar Efficient encoding for a family of quasi-cyclic LDPC codes , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[36]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[37]  P. Glenn Gulak,et al.  Reduced complexity symbol detectors with parallel structure for ISI channels , 1994, IEEE Trans. Commun..

[38]  C. Berrou,et al.  Non-binary convolutional codes for turbo coding , 1999 .

[39]  Ali Emre Pusane,et al.  A Comparison Between LDPC Block and Convolutional Codes , 2006 .

[40]  Roberto Garello,et al.  On error floor and free distance of turbo codes , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[41]  Peter Jung,et al.  Performance of rate compatible punctured Turbo-codes for mobile radio applications , 1997 .

[42]  E. Guizzo,et al.  Closing in on the perfect code [turbo codes] , 2004, IEEE Spectrum.

[43]  Joachim Hagenauer,et al.  The Decoding of Multidimensional Codes Using Separable Map "Filters" , 1992 .

[44]  Tor Aulin,et al.  Serially concatenated continuous phase modulation with iterative decoding , 2001, IEEE Trans. Commun..

[45]  Naresh R. Shanbhag,et al.  High-throughput LDPC decoders , 2003, IEEE Trans. Very Large Scale Integr. Syst..

[46]  Gianluca Piccinini,et al.  Architectural strategies for low-power VLSI turbo decoders , 2002, IEEE Trans. Very Large Scale Integr. Syst..

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

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

[49]  S. Brink Convergence of iterative decoding , 1999 .

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

[51]  Pingzhi Fan,et al.  On the complexity reduction of turbo decoding for wideband CDMA , 2005, IEEE Transactions on Wireless Communications.

[52]  Rüdiger L. Urbanke,et al.  The renaissance of Gallager's low-density parity-check codes , 2003, IEEE Commun. Mag..

[53]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

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

[55]  Paul Guinand,et al.  High-performance low-memory interleaver banks for turbo-codes , 2001, IEEE 54th Vehicular Technology Conference. VTC Fall 2001. Proceedings (Cat. No.01CH37211).

[56]  John Lodge,et al.  Near ML Performance for Linear Block Codes Using an Iterative Vector SISO Decoder , 2006 .

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

[58]  Hua Xiao,et al.  Graph-based message-passing schedules for decoding LDPC codes , 2004, IEEE Transactions on Communications.

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

[60]  Daniel A. Spielman,et al.  Improved low-density parity-check codes using irregular graphs and belief propagation , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[61]  David J. C. MacKay,et al.  Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

[62]  Hideki Imai,et al.  Reduced complexity iterative decoding of low-density parity check codes based on belief propagation , 1999, IEEE Trans. Commun..

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

[64]  H. Vincent Poor Turbo multiuser detection: A primer , 2001, Journal of Communications and Networks.

[65]  Marco Chiani,et al.  Some Remarks about a Possible New Standard for Telemetry Channel Coding with High Spectral Efficiency , 2002 .

[66]  Hamid R. Sadjadpour,et al.  Application of capacity approaching coding techniques to digital subscriber lines , 2004, IEEE Communications Magazine.

[67]  Wenwu Zhu,et al.  Recent advances on TD-SCDMA in China , 2005, IEEE Communications Magazine.

[68]  Christian Schlegel,et al.  Trellis and turbo coding , 2004 .

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

[70]  H. Jin,et al.  Irregular repeat accumulate codes , 2000 .

[71]  Subbarayan Pasupathy,et al.  Reduced complexity symbol detectors with parallel structures , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[72]  Sae-Young Chung,et al.  On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit , 2001, IEEE Communications Letters.

[73]  Claude Berrou,et al.  Frame-oriented convolutional turbo codes , 1996 .

[74]  Daniel J. Costello,et al.  LDPC block and convolutional codes based on circulant matrices , 2004, IEEE Transactions on Information Theory.

[75]  J. D. Andersen Turbo codes extended with outer BCH code , 1996 .

[76]  Christian Schlegel,et al.  On error bounds and turbo-codes , 1999, IEEE Communications Letters.

[77]  Marc P. C. Fossorier,et al.  Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices , 2004, IEEE Trans. Inf. Theory.

[78]  S. Crozier Construction and Performance of New Tail-Biting Turbo Codes , 1998 .

[79]  K. Gracie,et al.  Improving the Performance of 4-State Turbo Codes with the Correction Impulse Method and Data Puncturing , 2006, 23rd Biennial Symposium on Communications, 2006.

[80]  Jung-Fu Cheng,et al.  Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm , 1998, IEEE J. Sel. Areas Commun..

[81]  Mohammad M. Mansour,et al.  A 640-Mb/s 2048-bit programmable LDPC decoder chip , 2006, IEEE Journal of Solid-State Circuits.

[82]  Shu Lin,et al.  Error Control Coding , 2004 .

[83]  S.-C. Chang,et al.  Design considerations leading to the development of good /spl pi/-rotation LDPC codes , 2005, IEEE Communications Letters.

[84]  Kamil Sh. Zigangirov,et al.  Time-varying periodic convolutional codes with low-density parity-check matrix , 1999, IEEE Trans. Inf. Theory.

[85]  S. Dolinar Turbo Codes and Space Communications , 1998 .

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

[87]  Daniel J. Costello,et al.  On the frame-error rate of concatenated turbo codes , 2001, IEEE Transactions on Communications.

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

[89]  Massimo Ruo Roch,et al.  VLSI architectures for turbo codes , 1999, IEEE Trans. Very Large Scale Integr. Syst..

[90]  J. Vogt,et al.  Improving the max-log-MAP turbo decoder , 2000 .

[91]  Hans-Andrea Loeliger,et al.  Codes and iterative decoding on general graphs , 1995, Eur. Trans. Telecommun..

[92]  I. Chatzigeorgiou,et al.  Punctured binary turbo-codes with optimized performance , 2005, VTC-2005-Fall. 2005 IEEE 62nd Vehicular Technology Conference, 2005..

[93]  Pierre Penard,et al.  Design and Decoding of a Serial Concatenated Code Structure based on Quasi-Cyclic LDPC Codes , 2006 .

[94]  J. Boutros,et al.  Generalized low density (Tanner) codes , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[95]  P. Packan,et al.  Pushing the Limits , 1999, Science.

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

[97]  Roberto Garello,et al.  On the new CCSDS standard for space telemetry: turbo codes and symbol synchronization , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[98]  Marc P. C. Fossorier,et al.  A modified weighted bit-flipping decoding of low-density Parity-check codes , 2004, IEEE Communications Letters.

[99]  Mustafa Eroz,et al.  DVB‐S2 low density parity check codes with near Shannon limit performance , 2004, Int. J. Satell. Commun. Netw..

[100]  Jean-Luc Danger,et al.  Lambda-Min Decoding Algorithm of Regular and Irregular LDPC Codes , 2003 .

[101]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[102]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[103]  Shih-Chun Chang,et al.  Deterministic π-rotation low-density parity check codes , 2002 .

[104]  Dariush Divsalar,et al.  Analysis, Design, and Iterative Decoding of Double Serially Concatenated Codes with Interleavers , 1998, IEEE J. Sel. Areas Commun..

[105]  Stewart Crozier,et al.  Performance of Turbo Codes using MLSE-Based Early Stopping and Path Ambiguity Checking for Inputs Quantized to 4 Bits , 2006 .

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

[107]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

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

[109]  Patrick Robertson,et al.  A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain , 1995, Proceedings IEEE International Conference on Communications ICC '95.

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

[111]  Thomas J. Richardson,et al.  Methods and apparatus for decoding LDPC , 2002 .

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

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

[114]  Sangjin Hong,et al.  Power consumption vs. decoding performance relationship of VLSI decoders for low energy wireless communication system design , 1999, ICECS'99. Proceedings of ICECS '99. 6th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.99EX357).

[115]  Peter Adam Hoeher,et al.  Partially Systematic Rate 1/2 Turbo Codes , 2000 .

[116]  E. Rosnes,et al.  Improved algorithms for high rate turbo code weight distribution calculation , 2003, 10th International Conference on Telecommunications, 2003. ICT 2003..

[117]  R. Kerr,et al.  Performance of a 4-State Turbo Code with Data Puncturing and a BCH Outer Code , 2006, 23rd Biennial Symposium on Communications, 2006.

[118]  Pierre Penard,et al.  A Structured LDPC Code Construction for Efficient Encoder Design , 2006, 2006 IEEE International Conference on Communications.

[119]  Roberto Garello,et al.  Design and comparison of turbo codes under frame‐length and code‐rate constraints , 2006, Int. J. Satell. Commun. Netw..

[120]  K. Gracie,et al.  Performance of an MLSE-based early stopping technique for turbo codes , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.

[121]  Paul Guinand,et al.  Estimating the minimum distance of turbo-codes using double and triple impulse methods , 2005, IEEE Communications Letters.

[122]  Erica Klarreich Pushing the limit: Digital‐communications experts are zeroing in on the perfect code , 2005 .

[123]  Vincent C. Gaudet,et al.  Degree-Matched Check Node Decoding for Regular and Irregular LDPCs , 2006, IEEE Transactions on Circuits and Systems II: Express Briefs.

[124]  Ran Ginosar,et al.  Parallel interleaver design and VLSI architecture for low-latency MAP turbo decoders , 2005, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[125]  Rüdiger L. Urbanke,et al.  Efficient encoding of low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

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

[127]  Fabrizio Pollara,et al.  Turbo-Decoder Implementation for the Deep Space Network , 2001 .

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