Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Information Theory (ISIT)

EXIT Chart Analysis of Binary Message-Passing Decoders

Gottfried Lechner, Troels Pedersen, Gerhard G. Kramer

Published Jun 1, 2007• 8 citations
Publisher

Abstract

Binary message-passing decoders for LDPC codes are analyzed using EXIT charts. For the analysis, the variable node decoder performs all computations in the L-value domain. For the special case of a hard decision channel, this leads to the well-know Gallager B algorithm, while the analysis can be extended to channels with larger output alphabets. By increasing the output alphabet from hard decisions to four symbols, a gain of more than 1.0 dB is achieved using optimized codes. For this code optimization, the mixing property of EXIT functions has to be modified to the case of binary message-passing decoders.

DOI
10.1109/isit.2007.4557334

Related papers

Analysis and Design of Binary Message Passing Decoders

Gottfried Lechner, Troels Pedersen, Gerhard G. Kramer

Binary message passing decoders for low-density parity-check codes are studied by using extrinsic information transfer charts. The channel delivers hard or soft decisions and the variable node decoder performs all computations in the log-likelihood ratio (L-value) domain. A hard decision results in the Gallager B algorithm and examples show that increasing the channel output alphabet to two bits gains more than 1.0 dB in signal to noise ratio when using optimized codes. Finally, it is shown that errors on cycles consisting only of degree two and three variable nodes cannot be corrected and a necessary and sufficient condition for the existence of a cycle-free subgraph is derived.

arXiv:1004.4020•IEEE Transactions on Communications•Dec 29, 2011•50 citations

EXIT ChartAnalysisof Binary

Gottfried Lechner, Troels Pedersen, Frederik Bajers Vej +1 more

Binary message-passing decoders forLDPC codes areanalyzed using EXITcharts. Fortheanalysis, thevariable nodedecoder performs allcomputations intheL-value domain. Forthespecial caseofa harddecision channel, thisleadsto thewell-know Gallager B algorithm, whiletheanalysis canbe extended tochannels withlarger output alphabets. Byincreasing theoutput alphabet fromharddecisions tofoursymbols, again ofmorethan1.0dBisachieved using optimized codes. Forthis codeoptimization, themixing property ofEXITfunctions hasto bemodified tothecaseofbinary message-passing decoders.

•Jan 1, 2007•0 citations

On the EXIT chart analysis of low-density parity-check codes

S.R. Kollu, Hamid Jafarkhani

The extrinsic information transfer (EXIT) charts are used to analyze the sum-product decoding algorithm of low-density parity-check (LDPC) codes. The codes are optimized by performing curve fitting on EXIT charts. This technique is developed for binary erasure channels based on area property and is extended to other channels. We show that on channels where the area property is not valid, the curve fitting approach is a sub-optimal method of optimizing for the best convergence threshold. On Gaussian channels, the messages from variable nodes to check nodes are approximated by a symmetric Gaussian distribution. We prove that the check node detector mutual information transfer function derived using this approximation is an upper bound. So the EXIT chart analysis predicts an optimistic value for the convergence threshold. We give an empirical lower bound for the check node detector mutual information transfer function. For few irregular LDPC codes designed for AWGN channel using density evolution, we have examined the accuracy of convergence thresholds predicted by EXIT charts using these bounds for the check node transfer function. The analysis of EXIT chart technique presented in this paper can be extended to other channels for which the distribution of channel messages can be approximated by a symmetric Gaussian/Gaussian mixture distribution.

Globecom•Jan 1, 2005•14 citations

Efficient Analysis, Design and Decoding of Low-Density Parity-Check Codes

Masoud Ardakani

This dissertation presents new methods for the analysis, design and decoding of low-density parity-check (LDPC) codes. We start by studying the simplest class of decoders: the binary message-passing (BMP) decoders. We show that the optimum BMP decoder must satisfy certain symmetry and isotropy conditions, and prove that Gallager's Algorithm B is the optimum BMP algorithm. We use a generalization of extrinsic information transfer (EXIT) charts to formulate a linear program that leads to the design of highly efficient irregular LDPC codes for the BMP decoder. We extend this approach to the design of irregular LDPC codes for the additive white Gaussian noise channel. We introduce a "semi-Gaussian" approximation that very accurately predicts the behaviour of the decoder and permits code design over a wider range of rates and code parameters than in previous approaches. We then study the EXIT chart properties of the highest rate LDPC code which guarantees a certain convergence behaviour. We also introduce and analyze gear-shift decoding in which the decoder is permitted to select the decoding rule from among a predefined set. We show that this flexibility can give rise to significant reductions in decoding complexity. Finally, we show that binary LDPC codes can be combined with quadrature amplitude modulation to achieve near-capacity performance in a multitone system over frequency selective Gaussian channels.

•Jan 1, 2004•14 citations

Properties of Optimum Binary Message-Passing Decoders

Masoud Ardakani, Frank R. Kschischang

We consider a class of message-passing decoders for low-density parity-check (LDPC) codes whose messages are binary valued. We prove that if the channel is symmetric and all codewords are equally likely to be transmitted, an optimum decoding rule (in the sense of minimizing message error rate) should satisfy certain symmetry and isotropy conditions. Using this result, we prove that Gallager's Algorithm B achieves the optimum decoding threshold among all binary message-passing decoding algorithms for regular codes. For irregular codes, we argue that when the nodes of the message-passing decoder do not exploit knowledge of their decoding neighborhood, optimality of Gallager's Algorithm B is preserved. We also consider the problem of designing irregular LDPC codes and find a bound on the achievable rates with Gallager's Algorithm B. Using this bound, we study the case of low error-rate channels and analytically find good degree distributions for them.

IEEE Transactions on Information Theory•Sep 26, 2005•14 citations

The effect of cycles on binary message-passing decoding of LDPC codes

Gottfried Lechner

We study the error-floor behavior of binary message-passing decoders for low-density parity-check (LDPC) codes. We find that the stability condition is independent of the quality of the channel messages (i.e. soft or hard decision). Furthermore, we identify a structure in the graph where the involved variable nodes cannot be corrected by the binary message-passing decoder. This leads to an error floor for regular LDPC codes with variable node degree smaller than four. An additional constraint on the degree distribution is derived which allows to avoid this structure, leading to optimized LDPC codes without error floors.

Australian Communications Theory Workshop•Feb 1, 2010•5 citations
Binary message-passing decoders for LDPC codes are analyzed using EXIT charts. For the analysis, the variable node decoder performs all computations in the L-value domain. For the special case of a hard decision channel, this leads to the well-know Gallager B algorithm, while the analysis can be extended to channels with larger output alphabets. By increasing the output alphabet from hard decisions to four symbols, a gain of more than 1.0 dB is achieved using optimized codes. For this code optimization, the mixing property of EXIT functions has to be modified to the case of binary message-passing decoders.
Binary message passing decoders for low-density parity-check codes are studied by using extrinsic information transfer charts. The channel delivers hard or soft decisions and the variable node decoder performs all computations in the log-likelihood ratio (L-value) domain. A hard decision results in the Gallager B algorithm and examples show that increasing the channel output alphabet to two bits gains more than 1.0 dB in signal to noise ratio when using optimized codes. Finally, it is shown that errors on cycles consisting only of degree two and three variable nodes cannot be corrected and a necessary and sufficient condition for the existence of a cycle-free subgraph is derived.
Binary message-passing decoders forLDPC codes areanalyzed using EXITcharts. Fortheanalysis, thevariable nodedecoder performs allcomputations intheL-value domain. Forthespecial caseofa harddecision channel, thisleadsto thewell-know Gallager B algorithm, whiletheanalysis canbe extended tochannels withlarger output alphabets. Byincreasing theoutput alphabet fromharddecisions tofoursymbols, again ofmorethan1.0dBisachieved using optimized codes. Forthis codeoptimization, themixing property ofEXITfunctions hasto bemodified tothecaseofbinary message-passing decoders.
The extrinsic information transfer (EXIT) charts are used to analyze the sum-product decoding algorithm of low-density parity-check (LDPC) codes. The codes are optimized by performing curve fitting on EXIT charts. This technique is developed for binary erasure channels based on area property and is extended to other channels. We show that on channels where the area property is not valid, the curve fitting approach is a sub-optimal method of optimizing for the best convergence threshold. On Gaussian channels, the messages from variable nodes to check nodes are approximated by a symmetric Gaussian distribution. We prove that the check node detector mutual information transfer function derived using this approximation is an upper bound. So the EXIT chart analysis predicts an optimistic value for the convergence threshold. We give an empirical lower bound for the check node detector mutual information transfer function. For few irregular LDPC codes designed for AWGN channel using density evolution, we have examined the accuracy of convergence thresholds predicted by EXIT charts using these bounds for the check node transfer function. The analysis of EXIT chart technique presented in this paper can be extended to other channels for which the distribution of channel messages can be approximated by a symmetric Gaussian/Gaussian mixture distribution.
This dissertation presents new methods for the analysis, design and decoding of low-density parity-check (LDPC) codes. We start by studying the simplest class of decoders: the binary message-passing (BMP) decoders. We show that the optimum BMP decoder must satisfy certain symmetry and isotropy conditions, and prove that Gallager's Algorithm B is the optimum BMP algorithm. We use a generalization of extrinsic information transfer (EXIT) charts to formulate a linear program that leads to the design of highly efficient irregular LDPC codes for the BMP decoder. We extend this approach to the design of irregular LDPC codes for the additive white Gaussian noise channel. We introduce a "semi-Gaussian" approximation that very accurately predicts the behaviour of the decoder and permits code design over a wider range of rates and code parameters than in previous approaches. We then study the EXIT chart properties of the highest rate LDPC code which guarantees a certain convergence behaviour. We also introduce and analyze gear-shift decoding in which the decoder is permitted to select the decoding rule from among a predefined set. We show that this flexibility can give rise to significant reductions in decoding complexity. Finally, we show that binary LDPC codes can be combined with quadrature amplitude modulation to achieve near-capacity performance in a multitone system over frequency selective Gaussian channels.
We consider a class of message-passing decoders for low-density parity-check (LDPC) codes whose messages are binary valued. We prove that if the channel is symmetric and all codewords are equally likely to be transmitted, an optimum decoding rule (in the sense of minimizing message error rate) should satisfy certain symmetry and isotropy conditions. Using this result, we prove that Gallager's Algorithm B achieves the optimum decoding threshold among all binary message-passing decoding algorithms for regular codes. For irregular codes, we argue that when the nodes of the message-passing decoder do not exploit knowledge of their decoding neighborhood, optimality of Gallager's Algorithm B is preserved. We also consider the problem of designing irregular LDPC codes and find a bound on the achievable rates with Gallager's Algorithm B. Using this bound, we study the case of low error-rate channels and analytically find good degree distributions for them.
We study the error-floor behavior of binary message-passing decoders for low-density parity-check (LDPC) codes. We find that the stability condition is independent of the quality of the channel messages (i.e. soft or hard decision). Furthermore, we identify a structure in the graph where the involved variable nodes cannot be corrected by the binary message-passing decoder. This leads to an error floor for regular LDPC codes with variable node degree smaller than four. An additional constraint on the degree distribution is derived which allows to avoid this structure, leading to optimized LDPC codes without error floors.