Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-6bf8c574d5-5ws7s Total loading time: 0 Render date: 2025-03-11T17:15:21.274Z Has data issue: false hasContentIssue false

8 - Ensemble Enumerators for Turbo and LDPC Codes

Published online by Cambridge University Press:  06 March 2025

William E. Ryan ,
Shu Lin  and
Stephen G. Wilson
William E. Ryan
Affiliation:
Zeta Associates
Shu Lin
Affiliation:
University of California, Davis
Stephen G. Wilson
Affiliation:
University of Virginia
Get access

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 Codes
Classical and Modern
 , pp. 365 - 409
Publisher: Cambridge University Press
Print publication year: 2024

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Benedetto, S. and Montorsi, G., “Unveiling turbo codes: Some results on parallel concatenated coding schemes,” IEEE Transactions on Information Theory, vol. 42, no. 3, pp. 409–428, March 1996.Google Scholar
Benedetto, S. and Montorsi, G., “Design of parallel concatenated codes,” IEEE Transactions on Communications, vol. 44, no. 5, pp. 591–600, May 1996.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.CrossRefGoogle Scholar
Lin, S. and Costello, D. J., Jr., Error Control Coding, 2nd ed., New Saddle River, NJ, Prentice-Hall, 2004.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
Zhang, Y., Ryan, W. E., and Li, Y., “Structured eIRA codes,” 38th Asilo-mar Conference on Signals, Systems and Computers, November 2004, pp. 2005–2009.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.CrossRefGoogle Scholar
Divsalar, D., “Ensemble weight enumerators for protograph LDPC codes,” IEEE International Symposium on Information Theory, July 2006, pp. 1554–1558.Google Scholar
Abu-Surra, S., Ryan, W. E., and Divsalar, D., “Ensemble weight enumerators for protograph-based generalized LDPC codes,” UCSD ITA Workshop, January 2007, pp. 342–348.Google Scholar
Abu-Surra, S., Ryan, W. E., and Divsalar, D., “Ensemble trapping set enumerators for protograph-based LDPC codes,” Proceedings of the 45th Annual Allerton Conference on Communication, Control, and Computing, October 2007.Google Scholar
Abu-Surra, S., Ryan, W. E., and Divsalar, D., “Ensemble enumerators for protograph-based generalized LDPC codes,” 2007 IEEE Global Telecommunications Conference, November 2007, pp. 1492–1497.CrossRefGoogle Scholar
Di, C., Richardson, T., and Urbanke, R., “Weight distribution of low-density parity-check codes,” IEEE Transactions on Information Theory, vol. 52, no. 11, pp. 4839–4855, November 2006.CrossRefGoogle Scholar
Milenkovic, O., Soljanin, E., and Whiting, P., “Asymptotic spectra of trapping sets in regular and irregular LDPC code ensembles,” IEEE Transactions on Information Theory, vol. 53, no. 1, pp. 39–55, January 2007.Google Scholar
Richardson, T. and Urbanke, R., Modern Coding Theory, Cambridge, Cambridge University Press, 2008.CrossRefGoogle Scholar
Divsalar, D. and Jones, C., “Protograph based low error floor LDPC coded modulation,” 2005 IEEE MilCom Conference, October 2005, pp. 378–385.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 GlobeCom Conference, November–December 2006.Google Scholar
Divsalar, D., Dolinar, S., and Jones, C., “Construction of protograph LDPC codes with linear minimum distance,” 2006 International Symposium on Information Theory, July 2006, pp. 664–668.CrossRefGoogle Scholar
Divsalar, D., Dolinar, S., and Jones, C., “Protograph LDPC codes over burst erasure channels,” 2006 IEEE MilCom Conference, October 2006, pp. 1–7.Google Scholar
Divsalar, D. and Jones, C., “Protograph LDPC codes with node degrees at least 3,” 2006 IEEE GlobeCom Conference., November 2006, pp. 1–5.Google Scholar
Divsalar, D., Dolinar, S., and Jones, C., “Short protograph-based LDPC codes,” 2007 IEEE MilCom Conference, October 2007, pp. 1–6.Google Scholar
Gallager, R. G., Low-Density Parity-Check Codes, Cambridge, MA, MIT Press, 1963.CrossRefGoogle Scholar
Abu-Surra, S., Divsalar, D., and Ryan, W. E., “Ensemble enumerators for protograph-based generalized LDPC codes,” IEEE Transactions on Information Theory, pp. 858–886, February 2011.CrossRefGoogle Scholar
Cover, T. and Thomas, J., Elements of Information Theory, New York, Wiley, 1991.Google Scholar
Richardson, T., “Error-floors of LDPC codes,” Proceedings of the 41st Annual Allerton Conference on Communication, Control, and Computing, September 2003.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×