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
9 - Ensemble Decoding Thresholds for LDPC and 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. 410 - 453Publisher: Cambridge University PressPrint publication year: 2024
References
Richardson, T. and Urbanke, R., “The capacity of low-density parity-check codes under message-passing decoding,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 599–618, February 2001.Google Scholar
Richardson, T. and Urbanke, R., “Design of capacity-approaching irregular LDPC codes,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 619–637, February 2001.CrossRefGoogle Scholar
Yang, M., Ryan, W. E., and Li, Y., “Design of efficiently encodable moderate-length high-rate irregular LDPC codes,” IEEE Transactions on Communications, vol. 49, no. 4, pp. 564–571, April 2004.CrossRefGoogle Scholar
Kou, Y., Lin, S., and Fossorier, M., “Low-density parity-check codes based on finite geometries: A rediscovery and new results,” IEEE Transactions on Information Theory, vol. 47, no. 11, pp. 2711–2736, November 2001.Google Scholar
Chung, S.-Y., Forney, G. D., Jr., Richardson, T., and Urbanke, R., “On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit,” IEEE Communications Letters, vol. 4, no. 2, pp. 58–60, February 2001.CrossRefGoogle Scholar
Chung, S.-Y., Richardson, T., and Urbanke, R., “Analysis of sum–product decoding of LDPC codes using a Gaussian approximation,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 657–670, February 2001.Google Scholar
Peng, F., Ryan, W. E., and Wesel, R., “Surrogate-channel design of universal LDPC codes,” IEEE Communications Letters, vol. 10, no. 6, pp. 480–482, June 2006.CrossRefGoogle Scholar
Jones, C., Matache, A., Tian, T., Villasenor, J., and Wesel, R., “The universality of LDPC codes on wireless channels,” Proceedings of the Military Communications Conference (MILCOM), October 2003.Google Scholar
Franceschini, M., Ferrari, G., and Raheli, R., “Does the performance of LDPC codes depend on the channel?” Proceedings of the International Symposium on Information Theory and its Applications, 2004.Google Scholar
Jones, C., Tian, T., Villasenor, J., and Wesel, R., “The universal operation of LDPC codes over scalar fading channels,” IEEE Transactions on Communications, vol. 55, no. 1, pp. 122–132, January 2007.Google Scholar
Peng, F., Yang, M., and Ryan, W. E., “Simplified eIRA code design and performance analysis for correlated Rayleigh fading channels,” IEEE Transactions on Wireless Communications, vol. 5, no. 4, pp. 720–725, March 2006.CrossRefGoogle Scholar
Brink, S. ten, Kramer, G., and Ashikhmin, A., “Design of low-density parity-check codes for modulation and detection,” IEEE Transactions on Communications, vol. 52, no. 4, pp. 670–678, April 2004.Google Scholar
ten Brink, S. and Kramer, G., “Design of repeat–accumulate codes for iterative detection and decoding,” IEEE Transactions on Signal Processing, vol. 51, no. 11, pp. 2764–2772, November 2003.CrossRefGoogle Scholar
Ashikhmin, A., Kramer, G., and ten Brink, S., “Extrinsic information transfer functions: Model and erasure channel properties,” IEEE Transactions on Information Theory, vol. 50, pp. 2657–2673, November 2004.CrossRefGoogle Scholar
Divsalar, D., Dolinar, S., and Pollara, F., “Iterative turbo decoder analysis based on density evolution,” IEEE Journal on Selected Areas in Communications, vol. 19, no. 5, pp. 891–907, May 2001.CrossRefGoogle Scholar
El Gamal, H. and Hammons, A. R., “Analyzing the turbo decoder using the Gaussian approximation,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 671–686, February 2001.Google Scholar
Ardakani, M. and Kschischang, F. R., “A more accurate one-dimensional analysis and design of LDPC codes,” IEEE Transactions on Communications, vol. 52, no. 12, pp. 2106–2114, December 2004.CrossRefGoogle Scholar
ten Brink, S., “Convergence behavior of iteratively decoded parallel concatenated codes,” IEEE Transactions on Communications, vol. 49, no. 10, pp. 1727–1737, October 2001.Google Scholar
Tüchler, M., ten Brink, S., and Hagenauer, J., “Measures for tracing convergence of iterative decoding algorithms,” Proceedings of the 4th IEEE/ITG Conference on Source and Channel Coding, Berlin, January 2002.Google Scholar
Sharon, E., Ashikhmin, A., and Litsyn, S., “EXIT functions for the Gaussian channel,” Proceedings of the 40th Annual Allerton Conference on Communication, Control and Computers, October 2003, pp. 972–981.Google Scholar
Sharon, E., Ashikhmin, A., and Litsyn, S., “EXIT functions for binary input memoryless symmetric channels,” IEEE Transactions on Communications, vol. 54, no. 7, pp. 1207–1214, July 2006.CrossRefGoogle Scholar
Liva, G., Block Codes Based on Sparse Graphs for Wireless Communication Systems, PhD thesis, Università degli Studi di Bologna, 2006.Google Scholar
Liva, G. and Chiani, M., “Protograph LDPC codes design based on EXIT analysis,” Proceedings of the 2007 IEEE GlobeCom Conference, November 2007, pp. 3250–3254.Google Scholar
Liva, G., Song, S., Lan, L., Zhang, Y., Ryan, W. E., and Lin, S., “Design of LDPC codes: A survey and new results,” Journal of Communications Software and Systems, vol. 2, no. 9, pp. 191–211, September 2006.Google Scholar
Ashikhmin, A., Kramer, G., and ten Brink, S., “Extrinsic information transfer functions: A model and two properties,” 36th Annual Conference on Information Science Systems, Princeton University, March 2002.Google Scholar
Measson, C., Montanari, A., and Urbanke, R., “Why we cannot surpass capacity: The matching condition,” Proceedings of the 43rd Allerton Conference on Communications, Control, and Computing, September 2005.Google Scholar
Bhattad, K. and Narayanan, K., “An MSE based transfer chart to analyze iterative decoding schemes,” IEEE Transactions on Information Theory, vol. 53, no. 1, pp. 22–38, January 2007.CrossRefGoogle Scholar
Chung, S. Y., On the Construction of Capacity-Approaching Coding Schemes. PhD thesis, Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA, 2000.Google Scholar
Divsalar, D., Dolinar, S., Jones, C., and Andrews, K., “Capacity-approaching protograph codes,” IEEE Journal on Selected Areas in Communications, vol. 27, no. 6 pp. 876–888, August 2009.CrossRefGoogle Scholar
Chen, T.-Y., Vakilinia, K., Divsalar, D., and Wesel, R. D., “Protograph-based Raptor-like LDPC codes,” IEEE Transactions on Communications, vol. 63, no. 5 pp. 1522–1532, May 2015.CrossRefGoogle Scholar
Ochiai, H., Ikeya, K., and Mitran, P., “A new polar code design based on reciprocal channel approximation,” IEEE Transactions on Communications, vol. 71, no. 2 pp. 631–643, February 2023.CrossRefGoogle Scholar