The UMTS Turbo Code and an Efficient Decoder Implementation Suitable for Software-Defined Radios

This paper provides a description of the turbo code used by the UMTS third-generation cellular standard, as standardized by the Third-Generation Partnership Project (3GPP), and proposes an efficient decoder suitable for insertion into software-defined radio architectures or for use in computer simulations. Because the decoder is implemented in software, rather than hardware, single-precision floating-point arithmetic is assumed and a variable number of decoder iterations is not only possible but desirable. Three twists on the well-known log-MAP decoding algorithm are proposed: (1) a linear approximation of the correction function used by the max* operator, which reduces complexity with only a negligible loss in BER performance; (2) a method for normalizing the backward recursion that yields a 12.5% savings in memory usage; and (3) a simple method for halting the decoder iterations based only on the log-likelihood ratios.

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

[2]  Yufei W. Blankenship,et al.  A simple stopping criterion for turbo decoding , 2000, IEEE Communications Letters.

[3]  Stephen B. Wicker,et al.  Turbo Coding , 1998 .

[4]  Andrew J. Viterbi,et al.  An Intuitive Justification and a Simplified Implementation of the MAP Decoder for Convolutional Codes , 1998, IEEE J. Sel. Areas Commun..

[5]  B. Sklar.  A primer on turbo code concepts , 1997 .

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

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

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

[9]  Michel C. Jeruchim,et al.  Simulation of Communication Systems: Modeling, Methodology and Techniques , 2000 .

[10]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

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

[12]  P. Glenn Gulak,et al.  Simplified MAP Algorithm Suitable for Implementation of Turbo Decoders , 1998 .

[13]  Jung-Fu Cheng,et al.  Linearly approximated log-MAP algorithms for turbo decoding , 2000, VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026).

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

[15]  Joachim Hagenauer,et al.  The turbo principle-tutorial introduction and state of the art , 1997 .

[16]  Branka Vucetic,et al.  Turbo Codes: Principles and Applications , 2000 .

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

[18]  T. K. Blankenship,et al.  Fixed-point performance of low-complexity turbo decoding algorithms , 2001, IEEE VTS 53rd Vehicular Technology Conference, Spring 2001. Proceedings (Cat. No.01CH37202).

[19]  John G. Proakis,et al.  Digital Communications , 1983 .

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

[21]  Achilleas Anastasopoulos,et al.  Iterative Detection: Adaptivity, Complexity Reduction, and Applications , 2000 .

[22]  Masoud Salehi,et al.  Performance analysis of turbo decoder for 3GPP standard using the sliding window algorithm , 2001, 12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598).

[23]  Van Nostrand,et al.  Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm , 1967 .

[24]  K. Sam Shanmugan,et al.  Simulation of Communication Systems , 1992 .