Turbo Codes pp 39-80 | Cite as

Conquering the Map

Removing the main bottleneck of convolutional turbo decoders
  • Alexandre Giulietti
  • Bruno Bougard
  • Liesbet Van der Perre


A thorough analysis of convolutional turbo codes requires the well-understanding of its decoding algorithm. Two options are normally considered: the Maximum A Posteriori (MAP) algorithm published by Bahl et al. in 1974 [1] and the soft-output Viterbi decoding algorithm [2]. The complete derivation of the MAP is presented, making clear some points that are not thoroughly described in the available literature. Some simplifications normally applied to the MAP algorithm are also seen. Those simplifications are made in order to allow the efficient implementation of MAP decoders as the SISO modules required in convolutional turbo decoding. Trade-offs that have to be tackled when designing turbo decoders are made clear when a complete understanding of the decoding algorithm is achieved; that is the main purpose of Sections 3.2 and 3.3. Section 3.4 deals with different termination schemes for the turbo encoder, pointing out that termination is normally costly from the implementation point of view. Section 3.5 introduces the main bottlenecks when dealing with the log-max MAP algorithm and details several optimization steps that transform the slow recursion inherent to the MAP in a full parallel architecture with a special memory organization targeted at saving energy consumption.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Bahl, L.R., Cocke, J., Jelineck, F., and Raviv, J., “Optimal Decoding of Linear Codes for Minimizing Symbols Error Rate”, in IEEE Transactions on Information Theory, pp. 284–287, Mar. 1974.Google Scholar
  2. [2]
    Berrou, C, Adde, P., Angui, E., and Faudeil, S., “A Low Complexity Soft-Output Viterbi Decoder Architecture”, ICC’93, page 737–740, May 1993.Google Scholar
  3. [3]
    Berrou, C, Glavieux, A., and Thitimajshima, P., “Near Shannon Limit Error Correcting Coding and Decoding: Turbo Codes”, IEEE International Conference on Communications (ICC’93), Vol. 2/3, pp. 1064–1071, Geneva, Switzerland, May 1993.Google Scholar
  4. [4]
    GSM (Global System for Mobile Communications). Official web site available at 2003
  5. [5]
    IEEE. STD 802.11a – 1999, part 11; Wireless LAN Medium: Access Control (MAC) and Physical Layer (PHY) Specifications, 1999.Google Scholar
  6. [6]
    Robertson, P.; Villebrun, E.; Hoeher, P. A Comparison of Optimal and Sub-Optimal MAP Decoding Algorithms Operating in the Log Domain. In: IEEE International Conference on Communications, 1995. p. 1009–1013.Google Scholar
  7. [7]
    Viterbi, A.J. Error bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm. IEEE Transactions on Information Theory, v. 13, p.260–269,1967.zbMATHCrossRefGoogle Scholar
  8. [8]
    Ryan, W. “A Turbo Code Tutoria”l. Available at 1997.Google Scholar
  9. [9]
    Hokfelt, J., Carl Fredrik Leanderson, Ove Edfors and Torleiv Maseng. Distance Spectra of Turbo Codes Using Different Trellis Termination Methods. International Symposium on Turbo codes and Related Topics, Brest, France, September 2000.Google Scholar
  10. [10]
    Hokfelt, J.; Edfors, O.; Maseng, T. Methodical interleaver design for turbo codes. International Symposium on Turbo codes and Related Topics, Brest, 1997.Google Scholar
  11. [11]
    Giulietti, A.; Van der Perre, L.; Strum, M. Parallel turbo code interleavers: avoiding collisions in accesses to storage elements. Electronics Letters, v.38, n.5, 2002.Google Scholar
  12. [12]
    Barbulescu, S. A. and Pietrobon, S. S., “Terminating the trellis of turbo codes in the same state”, Electronic Letters, Vol.31, No.l, pp.22–23, Jan. 1995.CrossRefGoogle Scholar
  13. [13]
    Schurgers, C., Catthoor, F., Engels, M., “Energy Efficient Transfer and Storage Organization for a MAP Turbo Decoder Module”, in IEEE International Symosium on Low Power Design (ISLPED) San Diego, California, pp.76–81, August 1999.Google Scholar
  14. [14]
    Masera, G. et al. “VLSI Architectures for Turbo Codes”. IEEE Transactions on VLSI Systems, 7(3):369–379, September 1999.CrossRefGoogle Scholar
  15. [15]
    Wang, Z. et al. “VLSI Implementation Issues of Turbo Decoder Design for Wireless Applications”. Proceedings of SIPS’99, October 1999.Google Scholar
  16. [16]
    Berrou, C., Adde, P., Angui, E., Faudeil, S., “A low complexity soft-output viterbi decoder architecture”, Proceedings of ICC 1993, Geneva, Switzerland, pp. 737–740, May 1993.Google Scholar
  17. [17]
    Maessen, F., Van der Perre L., Willems, F., Engels, M., Catthoor, F., Gyselinckx, B., “Memory power optimization for the implementation of a high-speed turbo decoder”, SCVT Leuven, Belgium, 2000.Google Scholar
  18. [18]
    Yuk-Hang L.O., C-W. Yue, C-W., Tsui, C, Cheng, R.S. “Reducing Power Consumption of Turbo Code Decoder Using Adaptive Iteration with Variable Supply Voltage”, ISLPED’99.Google Scholar
  19. [19]
    Garrett, D., Stan, M., “Low Power Architecture of the Soft-Output Viterbi Algorithm”, ISLPED’98.Google Scholar
  20. [20]
    Hong S., Stark W. E., “Design and Implementation of a Low Complexity VLSI Turbo Code Decoder Architecture for Low Energy Mobile Wireless Communications”, Journal of VLSI Signal Processing Systems 24, 43–57 (2000).zbMATHCrossRefGoogle Scholar
  21. [21]
    Bickerstaff, M.A., et al., “A Unified Turbo/Viterbi Channel Decoder for 3GPP Mobile Wireless in 0.18-µm CMOS”, IEEE Journal of Solid-State Circuits, vol.37, no.l 1,November 2002.Google Scholar
  22. [22]
    Cathoor, F., et al, “Custom Memory Management Methodology, Exploration of Memory Organization for Embedded Multimedia System Design.” Kluwer Academic Publishers, 1988.Google Scholar
  23. [23]
    Dawid, H.; Meyr, H. Real-time algorithms and VLSI Architectures for Soft Output MAP Convolutional Decoding. 6th IEEE International Symposium on Personal Indoor and Mobile Radio Communications (PEVIRC’95), Toronto, 1995. v.3, p. 193–197.Google Scholar
  24. [24]
    Schurgers, C.; Catthoor, F.; Engels, M. Memory Optimization of MAP Turbo Decoder Algorithms. IEEE Transactions on VLSI, v.9, n.2, 2001.Google Scholar
  25. [25]
    Dielissen, J. et al., “Power-Efficient Application-Specific VLIW Processor for Turbo decoding”, in ISSCC 2001, San Francisco Feb. 2001.Google Scholar
  26. [26]
    Atomium (A Toolbox for Optimising Memory I/O Using geometrical Models). Official web site available at
  27. [27]
    Hagenauer, J.; Offer, E.; Papke, L. “Iterative Decoding of Binary Block and Convolutional Codes”, IEEE Transactions on Information Theory, v.42, n.2, p. 429–445, 1996.zbMATHCrossRefGoogle Scholar
  28. [28]
    E. Brockmeyer, A. Vandecappelle, S. Wuytack, F. Catthoor. Low Power Storage Cycle Budget Distribution Tool Support for Hierarchical Graphs. 13th International Symposium on System Synthesis, pp. 20ñ22, Madrid, Spain. 2000.Google Scholar
  29. [29]
    E. Brockmeyer, A. Vandecappelle, F. Catthoor. Systematic Cycle Budget versus System Power Trade-off: A New Perspective on System Exploration of Real-time Data-dominated Applications. International Symposium on Low Power Electronics and Design, pp. 137ñl42, Rapallo, Italy. 2000.Google Scholar
  30. [30]
    F. Catthoor, K. Danckaert, C. Kulkarni, E. Brockmeyer, P-G. Kjeldsberg, T. van Achteren, T. Omnes. Data Access and Storage Management for Embedded Programmable Processors. Kluwer Academic Publishers, Boston. 2002.zbMATHGoogle Scholar
  31. [31]
    F. Gilbert, A. Worm, N. Wehn. Low Power Implementation of a Turbo-Decoder on Programmable Architectures. Asia South Pacific Design Automation Conference (ASP-DAC), pp. 400ñ403, Yokohama, Japan. 2001.Google Scholar
  32. [32]
    S. Hong, W. E. Stark et al. Design and Implementation of a Low Complexity VLSI Turbo-Code Decoder Architecture for Low Energy Mobile Wireless Communications. Journal of VLSI Signal Processing, Vol. 24, No. 1, pp. 43ñ57. 2000.Google Scholar
  33. [33]
    Z. Wang, H. Suzuki, K. K. Parhi. VLSI Implementation Issues of Turbo Decoder Design for Wireless Applications. IEEE Workshop on Signal Processing Systems: Design and Implementation, Taipei. 1999.Google Scholar

Copyright information

© Springer Science+Business Media New York 2004

Authors and Affiliations

  • Alexandre Giulietti
    • 1
  • Bruno Bougard
    • 1
  • Liesbet Van der Perre
    • 1
  1. 1.DESICS DivisionIMECBelgium

Personalised recommendations