Abstract
The groundbreaking codes called turbo codes are introduced in Berrou et al. (Proceedings of ICC 1993, Geneva, Switzerland, pp. 1064–1070, 1993 [1]) and Berrou and Glavieux (IEEE Trans Commun 44(10):1261–1271, 1996 [2]). The best-known convolutional codes are mostly non-systematic. However, in turbo encoders, systematic convolutional codes are used. Turbo codes are generated by using the parallel concatenation of two recursive systematic convolutional (RSC) encoders. This chapter discusses turbo encoding, iterative turbo decoding, and performance analysis of turbo codes.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Berrou, C., Glavieux, A., Thitimajshima, P.: Near Shannon limit error-correcting coding and decoding: turbo-codes. In: Proceedings of ICC 1993, Geneva, Switzerland, pp. 1064–1070 (1993)
Berrou, C., Glavieux, A.: Near optimum error correcting coding and decoding: turbo-codes. IEEE Trans. Commun. 44(10), 1261–1271 (1996)
Jung, P., Nasshan, M.: Performance evaluation of turbo codes for short frame transmission systems. Electron. Lett. 30(2), 111–113 (1994)
Hanzo, L., Liew, T.H., Yeap, B.L.: Turbo Coding, Turbo Equalisation and Space Time Coding for Transmission Over Fading Channels. IEEE Press, Wiley Ltd., Hoboken (2002)
Bahl, L., Cocke, J., Jelinek, F., Raviv, J.: Optimal decoding of linear codes for minimizing symbol Error rate. IEEE Trans. Inf. Theor. 20, 284–287 (1974)
ten Brink, S.: Convergence behavior of iteratively decoded parallel concatenated codes. IEEE Trans. Commun. 49(10), 1727–1737 (2001)
Ryan, W.E., Lin, S.: Modern Codes: Classical and Modern. Cambridge University Press, Cambridge (2009)
Benedetto, S., Montorsi, G.: Unveiling turbo codes: some results on parallel concatenated coding schemes. IEEE Trans. Info. Theor. 42, 409–429 (1996)
Divsalar, D., Dolinar, S., McEliece, R.J., Pollara, F.: Transfer function bounds on the performance of turbo codes. TDA progress report 42-122, JPL, Caltech, August 1995
Ramesh, A., Chockalingam, A., Milstein, L.B.: Performance analysis of turbo codes on Nakagami fading channels with diversity combining. WRL-IISc-TR-108, Wireless Research Lab Technical Report, Indian Institute of Science, Bangalore, Jan 2001
Goldsmith, A., Alouini, M.-S.: A unified approach for calculating error rates of linearly modulated signals over generalized fading channels. IEEE Trans. Commun. 47, 1324–1334 (1999)
Du, K.-L., Swamy, M.N.S.: Wireless Communications: Communication Systems From RF Subsystems to 4G Enabling Technologies. Cambridge University Press, Cambridge (2010)
Schlegel, C.B., Perez, L.C.: Trellis and Turbo Coding. IEEE Press, Piscataway (2004)
Author information
Authors and Affiliations
Corresponding author
6.1 Electronic Supplementary Material
Below is the link to the electronic supplementary material.
Rights and permissions
Copyright information
© 2015 Springer India
About this chapter
Cite this chapter
Deergha Rao, K. (2015). Turbo Codes. In: Channel Coding Techniques for Wireless Communications. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2292-7_6
Download citation
DOI: https://doi.org/10.1007/978-81-322-2292-7_6
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-2291-0
Online ISBN: 978-81-322-2292-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)