Book contents
- Channel Codes
- Channel Codes
- Copyright page
- Dedication
- Contents
- Detailed Contents
- Preface to the Second Edition
- Acknowledgments (Second Edition)
- Preface to the First Edition
- Acknowledgments (First Edition)
- 1 Coding and Capacity
- 2 Finite Fields, Vector Spaces, Finite Geometries, and Graphs
- 3 Linear Block Codes
- 4 Convolutional Codes
- 5 Low-Density Parity-Check Codes
- 6 Computer-Based Design of LDPC Codes
- 7 Turbo Codes
- 8 Ensemble Enumerators for Turbo and LDPC Codes
- 9 Ensemble Decoding Thresholds for LDPC and Turbo Codes
- 10 Polar Codes
- 11 Finite-Geometry LDPC Codes
- 12 Constructions of LDPC Codes Based on Finite Fields
- 13 LDPC Codes Based on Combinatorial Designs, Graphs, and Superposition
- 14 LDPC Codes for Binary Erasure Channels
- 15 Nonbinary LDPC Codes
- Index
- References
7 - Turbo Codes
Published online by Cambridge University Press: 06 March 2025
Book contents
- Channel Codes
- Channel Codes
- Copyright page
- Dedication
- Contents
- Detailed Contents
- Preface to the Second Edition
- Acknowledgments (Second Edition)
- Preface to the First Edition
- Acknowledgments (First Edition)
- 1 Coding and Capacity
- 2 Finite Fields, Vector Spaces, Finite Geometries, and Graphs
- 3 Linear Block Codes
- 4 Convolutional Codes
- 5 Low-Density Parity-Check Codes
- 6 Computer-Based Design of LDPC Codes
- 7 Turbo Codes
- 8 Ensemble Enumerators for Turbo and LDPC Codes
- 9 Ensemble Decoding Thresholds for LDPC and Turbo Codes
- 10 Polar Codes
- 11 Finite-Geometry LDPC Codes
- 12 Constructions of LDPC Codes Based on Finite Fields
- 13 LDPC Codes Based on Combinatorial Designs, Graphs, and Superposition
- 14 LDPC Codes for Binary Erasure Channels
- 15 Nonbinary LDPC Codes
- Index
- References
Summary
Channel coding lies at the heart of digital communication and data storage. Fully updated to include current innovations in the field, including a new chapter on polar codes, this detailed introduction describes the core theory of channel coding, decoding algorithms, implementation details, and performance analyses. This edition includes over 50 new end-of-chapter problems to challenge students and numerous new figures and examples throughout.
The authors emphasize a practical approach and clearly present information on modern channel codes, including polar, turbo, and low-density parity-check (LDPC) codes, as well as detailed coverage of BCH codes, Reed–Solomon codes, convolutional codes, finite geometry codes, and product codes for error correction, providing a one-stop resource for both classical and modern coding techniques.
Assuming no prior knowledge in the field of channel coding, the opening chapters begin with basic theory to introduce newcomers to the subject. Later chapters then begin with classical codes, continue with modern codes, and extend to advanced topics such as code ensemble performance analyses and algebraic LDPC code design.
300 varied and stimulating end-of-chapter problems test and enhance learning, making this an essential resource for students and practitioners alike.
Provides a one-stop resource for both classical and modern coding techniques.
Starts with the basic theory before moving on to advanced topics, making it perfect for newcomers to the field of channel coding.
180 worked examples guide students through the practical application of the theory.
- Type
- Chapter
- Information
- Channel CodesClassical and Modern, pp. 322 - 364Publisher: Cambridge University PressPrint publication year: 2024
References
Berrou, C., Glavieux, A., and Thitimajshima, P., “Near Shannon limit error-correcting coding and decoding: Turbo codes,” Proceedings of the 1993 International Conference on Communications, 1993, pp. 1064–1070.Google Scholar
Berrou, C. and Glavieux, A., “Near optimum error correcting coding and decoding: Turbo-codes,” IEEE Transactions on Communications, pp. 1261–1271, October 1996.Google Scholar
Ungerboeck, G., “Channel coding with multilevel/phase signals,” IEEE Transactions on Information Theory, vol. 28, no. 1, pp. 55–67, January 1982.CrossRefGoogle Scholar
Robertson, P., “Illuminating the structure of code and decoder of parallel concatenated recursive systematic (turbo) codes,” Proceedings of GlobeCom 1994, 1994, pp. 1298–1303.Google Scholar
Benedetto, S. and Montorsi, G., “Unveiling turbo codes: Some results on parallel concatenated coding schemes,” IEEE Transactions on Information Theory, vol. 40, no. 3, pp. 409–428, March 1996.CrossRefGoogle Scholar
Benedetto, S. and Montorsi, G., “Design of parallel concatenated codes,” IEEE Transactions on Communications, pp. 591–600, May 1996.Google Scholar
Hagenauer, J., Offer, E., and Papke, L., “Iterative decoding of binary block and convolutional codes,” IEEE Transactions on Information Theory, vol. 42, no. 3, pp. 429–445, March 1996.CrossRefGoogle Scholar
Arnold, D. and Meyerhans, G., The Realization of the Turbo Coding System, Semester Project Report, ETH Zürich, July 1995.Google Scholar
Perez, L., Seghers, J., and Costello, D., “A distance spectrum interpretation of turbo codes,” IEEE Transactions on Information Theory, vol. 42, no. 11, pp. 1698–1709, November 1996.CrossRefGoogle Scholar
Bahl, L., Cocke, J., Jelinek, F., and Raviv, J., “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Transactions on Information Theory, vol. 20, no. 3, pp. 284–287, March 1974.CrossRefGoogle Scholar
Benedetto, S., Divsalar, D., Montorsi, G., and Pollara, F., “Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding,” IEEE Transactions on Information Theory, vol. 44, no. 5, pp. 909–926, May 1998.Google Scholar
Hagenauer, J. and Hoeher, P., “A Viterbi algorithm with soft-decision outputs and its applications,” 1989 IEEE Global Telecommunications Conference, November 1989, pp. 1680–1686.Google Scholar
Robertson, P., Villebrun, E., and Hoeher, P., “A comparison of optimal and suboptimal MAP decoding algorithms operating in the log domain,” Proceedings of the 1995 International Conference on Communications, pp. 1009–1013.Google Scholar
Viterbi, A., “An intuitive justification and a simplified implementation of the MAP decoder for convolutional codes,” IEEE Journal on Selected Areas in Communications, vol. 18, no. 2, pp. 260–264, February 1998.Google Scholar
Pyndiah, R., “Near-optimum decoding of product codes: Block turbo codes,” IEEE Transactions on Communications, vol. 46, no. 8, pp. 1003–1010, August 1998.Google Scholar
Elias, P., “Error-free coding,” IEEE Transactions on Information Theory, vol. 1, no. 9, pp. 29–37, September 1954.Google Scholar
Divsalar, D. and Pollara, F., Multiple Turbo Codes for Deep-Space Communications. JPL TDA Progress Report 42-121, May 15, 1995.Google Scholar
Sun, J. and Takeshita, O., “Interleavers for turbo codes using permutation polynomials over integer rings,” IEEE Transactions on Information Theory, pp. 101–119, January 2005.Google Scholar
Takeshita, O., “On maximum contention-free interleavers and permutation polynomials over integer rings,” IEEE Transactions on Information Theory, pp. 1249–1253, March 2006.Google Scholar
Valenti, M. C. and Cheng, S., “Iterative demodulation and decoding of turbo coded M-ary noncoherent orthogonal modulation,” IEEE Journal on Selected Areas in Communications (Special Issue on Differential and Noncoherent Wireless Communications), vol. 23, no. 9, pp. 1738–1747, September 2005.Google Scholar
Takeshita, O., “Permutation polynomial interleavers: An algebraic-geometric perspective,” IEEE Transactions on Information Theory, pp. 2116–2132, June 2007.CrossRefGoogle Scholar
Ryu, J., Permutation Polynomial Based Interleavers for Turbo Codes over Integer Rings: Theory and Applications, PhD thesis, ECE Department, Ohio State University, 2007.Google Scholar
Acikel, O. and Ryan, W., “Punctured turbo codes for BPSK/QPSK channels,” IEEE Transactions on Communications, vol. 47, no. 9, pp. 1315–1323, September 1999.CrossRefGoogle Scholar
Acikel, O. and Ryan, W., “Punctured high rate SCCCs for BPSK/QPSK channels,” Proceedings of the 2000 IEEE International Conference on Communications, June 2000, pp. 434–439.Google Scholar
Battail, G., “Ponderation des symboles decodes par l’algorithme de Viterbi,” Annals of Telecommunications, pp. 31–38, January 1987.Google Scholar
Wiberg, N., Codes and Decoding on General Graphs, PhD thesis, University of Linköping, Sweden, 1996.Google Scholar
Lin, L. and Cheng, R. S., “Improvements in SOVA-based decoding for turbo codes,” Proceedings of ICC, Montreal, Canada, pp. 1473–1478, June 1997.Google Scholar
Fossorier, M., Burkert, F., Lin, S., and Hagenauer, J., “On the equivalence between SOVA and Max-Log-MAP Decodings,” IEEE Communications Letters, pp. 137–139, May 1998.Google Scholar
Huang, C. X. and Ghrayeb, A., “A simple remedy for the exaggerated extrinsic information produced by the SOVA algorithm,” IEEE Transactions on Wireless Communications, vol. 5, no. 5, pp. 996–1002, May 2006.CrossRefGoogle Scholar
Ghrayeb, A. and Huang, C. X., “Improvements in SOVA-based decoding for turbo-coded storage channels,” IEEE Transactions on Magnetics, vol. 41, no. 12, pp. 4435–4442, December 2005.CrossRefGoogle Scholar
Coŧkun, M., Durisi, G., Jerkovits, T., Liva, G., Ryan, W., Stein, B., and Steiner, F., “Efficient error-correcting codes in the short blocklength regime,” Physical Communication, vol. 34, pp. 66–79, June 2019.Google Scholar
Liva, G., Paolini, E., Matuz, B., Scalise, S., and Chiani, M., “Short turbo codes over high order fields,” IEEE Transactions on Communications, pp. 2201–2211, June 2013.CrossRefGoogle Scholar