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
6 - Computer-Based Design of LDPC 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. 281 - 321Publisher: Cambridge University PressPrint publication year: 2024
References
Gallager, R. G., Low-Density Parity-Check Codes, Cambridge, MA, MIT Press, 1963. (Also, Gallager, R. G., “Low density parity-check codes,” IRE Transactions on Information Theory, vol. 8, no. 1, pp. 21–28, January 1962.)CrossRefGoogle Scholar
MacKay, D., “Good error correcting codes based on very sparse matrices,” IEEE Transactions on Information Theory, vol. 45, no. 3, pp. 399–431, March 1999.CrossRefGoogle Scholar
Hu, X.-Y., Eleftheriou, E., and Arnold, D.-M., “Progressive edge-growth Tanner graphs,” 2001 IEEE Global Telecommunications Conference, November 2001, pp. 995–1001.Google Scholar
Tian, T., Jones, C., Villasenor, J., and Wesel, R., “Construction of irregular LDPC codes with low error floors,” 2003 IEEE International Conference on Communications, May 2003, pp. 3125–3129.Google Scholar
Richardson, T. J. and Urbanke, R., “Efficient encoding of low-density parity-check codes,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 638–656, February 2001.CrossRefGoogle Scholar
Vasic, B. and Milenkovic, O., “Combinatorial constructions of low-density parity-check codes for iterative decoding,” IEEE Transactions on Information Theory, vol. 50, no. 6, pp. 1156–1176, June 2004.Google Scholar
Xiao, H. and Banihashemi, A., “Improved progressive-edge-growth (PEG) construction of irregular LDPC codes,” 2004 IEEE Global Telecommunications Conference, November–December 2004, pp. 489–492.Google Scholar
Richardson, T. and Novichkov, V., “Methods and apparatus for decoding LDPC codes,” U.S. Patent 6,633,856, October 14, 2003.Google Scholar
Thorpe, J., Low Density Parity Check (LDPC) Codes Constructed from Protographs. JPL INP Progress Report 42-154, August 15, 2003.Google Scholar
Divsalar, D., Jones, C., Dolinar, S., and Thorpe, J., “Protograph based LDPC codes with minimum distance linearly growing with block size,” 2005 IEEE Global Telecomunications Conference.Google Scholar
Divsalar, D., Dolinar, S., and Jones, C., “Construction of protograph LDPC codes with linear minimum distance,” 2006 International Symposium on Information Theory.Google Scholar
Richardson, T. and Novichkov, V., “Method and apparatus for decoding LDPC codes,” U.S. Patent 7,133,853, November 7, 2006.Google Scholar
Zhang, Y., Design of Low-Floor Quasi-Cyclic IRA Codes and their FPGA Decoders, PhD thesis, ECE Department, University of Arizona, May 2007.Google Scholar
Jones, C., Dolinar, S., Andrews, K., Divsalar, D., Zhang, Y., and Ryan, W., “Functions and architectures for LDPC decoding,” 2007 IEEE Information Theory Workshop, pp. 577–583, September 2–6, 2007.CrossRefGoogle Scholar
Richardson, T., “Multi-edge type LDPC codes,” paper presented at the workshop honoring Professor R. McEliece on his 60th birthday, California Institute of Technology, Pasadena, CA, May 24–25, 2002.Google Scholar
Divsalar, D., Jin, H., and McEliece, R., “Coding theorems for turbo-like codes,” Proceedings of the 36th Annual Allerton Conference on Communication, Control, and Computing, September 1998, pp. 201–210.Google Scholar
Jin, H., Khandekar, A., and McEliece, R., “Irregular repeat–accumulate codes,” Proceedings of the 2nd International Symposium on Turbo Codes and Related Topics, Brest, France, September 2000, pp. 1–8.Google 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. 52, no. 4, pp. 564–571, April 2004.Google Scholar
Zhang, Y. and Ryan, W. E., “Structured IRA codes: Performance analysis and construction,” IEEE Transactions on Communications, vol. 55, no. 5, pp. 837–844, May 2007.Google Scholar
Tanner, R. M., “On quasi-cyclic repeat–accumulate codes,” Proceedings of the 37th Allerton Conference on Communication, Control, and Computing, September 1999.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
Dinoi, L., Sottile, F., and Benedetto, S., “Design of variable-rate irregular LDPC codes with low error floor,” 2005 IEEE International Conference on Communications, May 2005, pp. 647–651.CrossRefGoogle Scholar
Zhang, Y., Ryan, W. E., and Li, Y., “Structured eIRA codes,” Proceedings of the 38th Asilomar Conference on Signals, Systems, and Computing, Pacific Grove, CA, November 2004, pp. 7–10.Google Scholar
Hagenauer, J., “Rate-compatible punctured convolutional codes and their applications,” IEEE Transactions on Communications, vol. 36, no. 4, pp. 389–400, April 1988.CrossRefGoogle Scholar
Liva, G., Paolini, E., and Chiani, M., “Simple reconfigurable low-density parity-check codes,” IEEE Communications Letters, vol. 9, no. 3, pp. 258–260, March, 2005.CrossRefGoogle Scholar
Johnson, S. J. and Weller, S. R., “Constructions for irregular repeat–accumulate codes,” Proceedings of the IEEE International Symposium on Information Theory, Adelaide, September 2005.Google Scholar
Abbasfar, A., Divsalar, D., and Yao, K., “Accumulate repeat accumulate codes,” Proceedings of the 2004 IEEE GlobeCom Conference, Dallas, TX, November 2004.Google Scholar
Abbasfar, A., Divsalar, D., and Yao, K., “Accumulate–repeat–accumulate codes,” IEEE Transactions on Communications, vol. 55, no. 4, pp. 692–702, April 2007.CrossRefGoogle Scholar
Andrews, K., Dolinar, S., Divsalar, D., and Thorpe, J., Design of Low-Density Parity-Check (LDPC) Codes for Deep-Space Applications, JPL IPN Progress Report 42–159, November 15, 2004.Google Scholar
Andrews, K., Dolinar, S., and Thorpe, J., “Encoders for block-circulant LDPC codes,” Proceedings of the 2005 International Symposium on Information Theory, September 2005.CrossRefGoogle Scholar
Andrews, K., Dolinar, S., Divsalar, D., and Thorpe, J., Low-Density Parity-Check Code Design Techniques to Simplify Encoding, JPL IPN Progress Report 42–171, November 15, 2007.Google Scholar
CCSDS, Report, TM Synchronization and Channel Coding – Summary of Concept and Rationale, Green Book, June 2020.Google Scholar
ETSI Standard TR 102 376 V1.1.1: Digital Video Broadcasting (DVB) User Guidelines for the Second Generation System for Broadcasting, Interactive Services, News Gathering and Other Broadband Satellite Applications (DVB-S2). http://webapp.etsi.org/workprogram/Report_WorkItem.asp?WKI_ID=21402.Google Scholar
Valenti, M. C., Cheng, S., and Iyer Seshadri, R., “Turbo and LDPC codes for digital video broadcasting,” Chapter 12 of Turbo Code Applications: A Journey from a Paper to Realization, Berlin, Springer-Verlag, 2005.Google Scholar
Low Density Parity Check Codes for Use in Near-Earth and Deep Space. Orange Book, Issue 2, September 2007, http://public.ccsds.org/publications/Or-angeBooks.aspx.Google Scholar
Dolinar, S., “A rate-compatible family of protograph-based LDPC codes built by expurgation and lengthening,” Proceedings of the 2005 International Symposium on Information Theory, September 2005, pp. 1627–1631.CrossRefGoogle Scholar
Chen, T.-Y., Vakilinia, K., Divsilar, D., and Wesel, R., “Protograph-based Raptor-like codes,” IEEE Transactions on Communications, pp. 1522–1532, May 2015.CrossRefGoogle Scholar
Shokrollahi, A., “Raptor codes,” IEEE Transactions on Information Inf. Theory, pp. 2551–2567, June 2006.CrossRefGoogle Scholar
Liva, G., Ryan, W. E., and Chiani, M., “Quasi-cyclic generalized LDPC codes with low error floors,” IEEE Transactions on Communications, pp. 49–57, January 2008.CrossRefGoogle Scholar