Fundamentals of Turbo Codes

  • Lucian TrifinaEmail author
  • Daniela Tarniceriu
Part of the Signals and Communication Technology book series (SCT)


Turbo codes are composed of two or more convolutional codes. Therefore, in Sect. 2.1 we present the manner in which they can be described (i.e. generator matrix, state diagram and trellis diagram). Notions such as minimum Hamming distance, weight of a bit sequence, weight enumeration functions are assumed to be known (Proakis 1995; Trifina and Munteanu 2008). Then, in Sect. 2.2, we give the structure of a turbo code with two component convolutional codes. In Sect. 2.3 we present five methods to terminate the trellises for the two component convolutional codes of a turbo code. This operation is required to obtain a good error rate performance. Finally, in Sect. 2.4, we describe Garello’s algorithm (Garello et al. 2001) for calculating the distance spectrum of a turbo code with a particular interleaver.


Turbo Codes Distance Spectrum Garello Component Convolutional Codes Trellis Termination 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. S. Benedetto, G. Montorsi, Unveiling turbo codes: some results on parallel concatenated coding schemes. IEEE Trans. Inf. Theory 42(2), 409–428 (1996)CrossRefGoogle Scholar
  2. C. Berrou, C. Douillard, M. Jezequel, Multiple parallel concatenation of circular recursive systematic convolutional (CRSC) codes. Ann. Telecommun. 54(3–4), 166–172 (1999)Google Scholar
  3. M. Breiling, S. Peeters, J. Huber, Class of double terminating turbo code interleavers. Electron. Lett. 35(5), 389–391 (1999)CrossRefGoogle Scholar
  4. D.J. Costello, Construction of convolutional codes for sequential decoding (University of Notre Dame, Notre Dame, Indiana, USA, 1969)Google Scholar
  5. F. Daneshgaran, M. Mondin, An efficient algorithm for obtaining the distance spectrum of turbo codes. In: 1st International Symposium on Turbo Codes. Brest, France, 3–5 September 1997, pp. 251–254Google Scholar
  6. D. Divsalar, F. Pollara, Turbo codes for PCS applications. In: IEEE International Conference on Communications (ICC). Seattle, WA, USA, 18–22 June 1995, pp. 54–59Google Scholar
  7. G.D. Forney Jr., Convolutional codes I: algebraic structure. IEEE Trans. Inf. Theory 16(6), 720–738 (1970)MathSciNetCrossRefGoogle Scholar
  8. R. Garello, P. Pierleoni, S. Benedetto, Computing the free distance of turbo codes and serially concatenated codes with interleavers: algorithms and applications. IEEE J. Sel. Areas Commun. 19(5), 800–812 (2001)CrossRefGoogle Scholar
  9. P. Guinand, J. Lodge, Trellis termination for turbo encoders. In: 17th Biennial Symposium on Communications. Queen’s University, Kingston, Canada, May 30–June 1 1994, pp. 389–392Google Scholar
  10. J. Hokfelt, O. Edvors, T. Maseng, On the theory and performance of trellis termination methods of turbo codes. IEEE J. Sel. Areas Commun. 19(5), 838–847 (2001)CrossRefGoogle Scholar
  11. C.L. Perez, J. Seghers, D.J. Costello Jr., A distance spectrum interpretation of turbo codes. IEEE Trans. Inf. Theory 42(6), 1698–1709 (1996)MathSciNetCrossRefGoogle Scholar
  12. J.G. Proakis, Digital Communications, 3rd edn. (McGraw-Hill, New York, 1995)Google Scholar
  13. E. Rosnes, \(\varnothing \). Ytrehus, Improved algorithms for the determination of turbo-code weight distributions. IEEE Trans. Commun. 53(1), 20–26 (2005)CrossRefGoogle Scholar
  14. L. Trifina, V. Munteanu, Coduri Turbo (Politehnium, Iasi, 2008)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Faculty of Electronics, Telecommunications and Information TechnologyGheorghe Asachi Technical UniversityIașiRomania

Personalised recommendations