Iterative and Maximum-Likelihood Decoding of LDPC Codes

Enrico Paolini; Gianluigi Liva; Balázs Matuz; Marco Chiani

doi:10.1017/9781316443354.007

6 - Iterative and Maximum-Likelihood Decoding of LDPC Codes

Published online by Cambridge University Press: aN Invalid Date NaN

Balázs Matuz and

Enrico Paolini: Affiliation:
University of Bologna
Gianluigi Liva: Affiliation:
German Aerospace Center, Wessling
Balázs Matuz: Affiliation:
Huawei Munich Research Center
Marco Chiani: Affiliation:
University of Bologna

Book contents

Get access

Summary

Decoding of LDPC codes on the erasure channel: In Chapter 6, we illustrate different decoding algorithms for LDPC codes over erasure channels, namely, iterative (IT) and maximum likelihood (ML) decoding. Decoding on the erasure channel can be strongly simplified with respect to decoding on other channels, since whenever a symbol is not erased, we know its value with full certainty. We illustrate that iterative decoding can be done by a peeling process which resolves one unknown per iteration. ML decoding can be performed efficiently by solving a sparse system of equations by variants of the Gaussian elimination algorithm.

Keywords

iterative decoding peeling decoding maximum-likelihood decoding

Information

Type: Chapter
Information: Coding for Erasure Channels , pp. 133 - 160

DOI: https://doi.org/10.1017/9781316443354.007 [Opens in a new window]

Publisher: Cambridge University Press

Print publication year: 2026

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.)

Book purchase

Temporarily unavailable

References

Gallager, R., Low-density parity-check codes. Cambridge, MA, USA: MIT Press, 1963.10.7551/mitpress/4347.001.0001CrossRef Google Scholar

Tanner, M., “A recursive approach to low complexity codes,” IEEE Trans. Inf. Theory, vol. 27, no. 5, pp. 533–547, Sep. 1981.10.1109/TIT.1981.1056404CrossRef Google Scholar

Pearl, J., “Reverend Bayes on inference engines: A distributed hierarchical approach,” in Nat. Conf. Artificial Intelligence, Pittsburgh, PA, USA, Aug. 1982, pp. 133–136.Google Scholar

Pearl, J., Probabilistic reasoning in intelligent systems: Networks of plausible inference. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 1988.Google Scholar

Koller, D. and Friedman, N., Probabilistic graphical models, ser. Adaptive Computation and Machine Learning series. London, England: MIT Press, Jul. 2009.Google Scholar

Berrou, C., Glavieux, A., and Thitimajshima, P., “Near Shannon limit error-correcting coding and decoding: Turbo-codes,” in Proc. IEEE Int. Conf. Commun., Geneva, Switzerland, May 1993.Google Scholar

MacKay, D. and Neal, R., “Good codes based on very sparse matrices,” in 5^th IMA Conference Cirencester, ser. Lecture Notes in Computer Science, C. Boyd, Ed., vol. 1025. Springer Berlin Heidelberg, Dec. 1995, pp. 100–111.Google Scholar

McEliece, R., MacKay, D., and Cheng, J.-F., “Turbo decoding as an instance of Pearl’s ‘belief propagation’ algorithm,” IEEE J. Sel. Areas Commun., vol. 16, no. 2, pp. 140–152, Feb. 1998.10.1109/49.661103CrossRef Google Scholar

MacKay, D., “Good error-correcting codes based on very sparse matrices,” IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399–431, Mar. 1999.CrossRef Google Scholar

Wiberg, N., Loeliger, H., and Kötter, R., “Codes and iterative decoding on general graphs,” European Trans. Telecommun., vol. 6, no. 5, p. 513–525, Sep. 1995.10.1002/ett.4460060507CrossRef Google Scholar

Wiberg, N., “Codes and decoding on general graphs,” Ph.D. dissertation, Linköping University, Linköping, Sweden, Apr. 1996.Google Scholar

Forney, G., “Codes on graphs: normal realizations,” IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 520–548, Feb. 2001.CrossRef Google Scholar

Kschischang, F., Frey, B., and Loeliger, H.-A., “Factor graphs and the sum-product algorithm,” IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498–519, Feb. 2001.10.1109/18.910572CrossRef Google Scholar

Aji, S. and McEliece, R., “The generalized distributive law,” IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 325–343, Mar. 2000.10.1109/18.825794CrossRef Google Scholar

Etzion, T., Trachtenberg, A., and Vardy, A., “Which codes have cycle-free Tanner graphs?” IEEE Trans. Inf. Theory, vol. 45, no. 6, pp. 2173–2181, Sep. 1999.CrossRef Google Scholar

MacKay, D., Information theory, inference & learning algorithms. New York, NY, USA: Cambridge University Press, 2002.Google Scholar

Richardson, T. and Urbanke, R., Modern coding theory. New York, NY, USA: Cambridge University Press, 2008.CrossRef Google Scholar

Ryan, W., Lin, S., and Wilson, S., Channel codes – Classical and modern. New York, NY, USA: Cambridge University Press, 2024.10.1017/9781009335928CrossRef Google Scholar

Zyablov, V. V. and Pinsker, M. S., “Decoding complexity of low-density codes for transmission in a channel with erasures,” Probl. Peredachi Inf., vol. 10, no. 1, pp. 15–28, 1974.Google Scholar

Luby, M., Mitzenmacher, M., Shokrollahi, A., Spielman, D., and Stemann, V., “Practical loss-resilient codes,” in Proc. 29^th Symp. Theory Computing, El Paso, TX, USA, May 1997, pp. 150–159.Google Scholar

Luby, M., Mitzenmacher, M., Shokrollahi, A., and Spielman, D., “Efficient erasure correcting codes,” IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 569–584, Feb. 2001.10.1109/18.910575CrossRef Google Scholar

Richardson, T. and Urbanke, R., “Efficient encoding of low-density parity-check codes,” IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 638–656, Feb. 2001.10.1109/18.910579CrossRef Google Scholar

Hu, X.-Y., Eleftheriou, E., and Arnold, D., “Regular and irregular progressive edge-growth Tanner graphs,” IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 386–398, Jan. 2005.10.1109/TIT.2004.839541CrossRef Google Scholar

Tian, T., Jones, C., Villasenor, J. D., and Wesel, R., “Selective avoidance of cycles in irregular LDPC code construction,” IEEE Trans. Commun., vol. 52, no. 8, pp. 1242–1247, Aug. 2004.10.1109/TCOMM.2004.833048CrossRef Google Scholar

Odlyzko, A. M., “Discrete logarithms in finite fields and their cryptographic significance,” in Proc. EUROCRYPT Workshop on Advances in Cryptology: Theory and Application of Cryptographic Techniques, Paris, France, Apr. 1984, pp. 224–314.Google Scholar

LaMacchia, B. and Odlyzko, A., “Solving large sparse linear systems over finite fields,” in Proc. 10^th Ann. Int. Crypt. Conf. Adv. in Crypt., Santa Barbara, CA, USA, Aug. 1990, pp. 109–133.Google Scholar

Pomerance, C. and Smith, J. W., “Reduction of huge, sparse matrices over finite fields via created catastrophes,” Experimental Mathematics, vol. 1, no. 2, pp. 89–94, 1992.CrossRef Google Scholar

Berlekamp, E., Algebraic coding theory. New York, NY, USA: McGraw-Hill, 1968.Google Scholar

Pishro-Nik, H. and Fekri, F., “On decoding of low-density parity-check codes over the binary erasure channel,” IEEE Trans. Inf. Theory, vol. 50, no. 3, pp. 439–454, Mar. 2004.10.1109/TIT.2004.824918CrossRef Google Scholar

Burshtein, D. and Miller, G., “An efficient maximum likelihood decoding of LDPC codes over the binary erasure channel,” IEEE Trans. Inf. Theory, vol. 50, no. 11, pp. 2837–2844, Nov. 2004.CrossRef Google Scholar

Vellambi, B. and Fekri, F., “Results on the improved decoding algorithm for low-density parity-check codes over the binary erasure channel,” IEEE Trans. Inf. Theory, vol. 53, no. 4, pp. 1510–1520, Apr. 2007.10.1109/TIT.2007.892812CrossRef Google Scholar

Shokrollahi, M., Lassen, S., and Karp, R., “Systems and processes for decoding chain reaction codes through inactivation,” Feb. 2005, US Patent 6,856,263.Google Scholar

Coşkun, M. C., Neu, J., and Pfister, H. D., “Successive cancellation inactivation decoding for modified Reed-Muller and eBCH codes,” in Proc. IEEE Int. Symp. Inf. Theory. Los Angeles, CA, USA: IEEE, June 2020, pp. 437–442.Google Scholar

Paolini, E., Liva, G., Matuz, B., and Chiani, M., “Maximum likelihood erasure decoding of LDPC codes: Pivoting algorithms and code design,” IEEE Trans. Commun., vol. 60, no. 11, pp. 3209–3220, Nov. 2012.10.1109/TCOMM.2012.081012.110363CrossRef Google Scholar

Measson, C., Montanari, A., and Urbanke, R., “Maxwell construction: The hidden bridge between iterative and maximum a posteriori decoding,” IEEE Trans. Inf. Theory, vol. 54, no. 12, pp. 5277–5307, Dec. 2008.10.1109/TIT.2008.2006466CrossRef Google Scholar

Accessibility standard: WCAG 2.2 A

Why this information is here

This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

Accessibility Information

The PDF of this book complies with version 2.2 of the Web Content Accessibility Guidelines (WCAG), offering more comprehensive accessibility measures for a broad range of users and meets the basic (A) level of WCAG compliance, addressing essential accessibility barriers.

Content Navigation

Table of contents navigation
Allows you to navigate directly to chapters, sections, or non‐text items through a linked table of contents, reducing the need for extensive scrolling.

Index navigation
Provides an interactive index, letting you go straight to where a term or subject appears in the text without manual searching.

Reading Order & Textual Equivalents

Single logical reading order
You will encounter all content (including footnotes, captions, etc.) in a clear, sequential flow, making it easier to follow with assistive tools like screen readers.

Short alternative textual descriptions
You get concise descriptions (for images, charts, or media clips), ensuring you do not miss crucial information when visual or audio elements are not accessible.