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

Optimization of LDPC Finite Precision Belief Propagation Decoding with Discrete Density Evolution

David Declercq, François S. Verdier

Published Sep 1, 2003• 4 citations
OpenAlex

Related papers

Optimal Output Quantization of Binary Input AWGN Channel for Belief-Propagation Decoding of LDPC Codes

Junho Cho, Jonghong Kim, Wonyong Sung

Optimal quantizers for channel output are especially necessary for very high speed and memory-cell sensing applications where high-precision analog-to-digital converters are not available. This paper investigates a method to find optimal output quantizers for a binary input (BI) additive white Gaussian noise (AWGN) channel when regular low-density parity-check (LDPC) codes are used with belief-propagation (BP) decoding. The optimal quantizers are found by uni-parametric and multi-parametric optimization methods based on the discretized density evolution (DE). The capacity of various LDPC code ensembles are also provided with the BI-AWGN channel outputs quantized using these optimal quantizers. It is demonstrated that only 3 bits of quantization precision performs almost within 0.1 dB of the infinite precision channel output. The effect of the code rate and the degree distribution of LDPC codes on the optimal quantization boundaries is analyzed.

SiPS ... design and implementation - IEEE Workshop on Signal Processing Systems•Oct 1, 2012•4 citations

Near optimum universal belief propagation based decoding of LDPC codes

J. Chen

IEEE Transactions on Communications•Jan 1, 2002•20 citations

Low-complexity finite precision decoders for low-density parity-check codes

Shiva Kumar Planjery

We present a new class of finite-precision decoders for low-density parity-check (LDPC) codes. These decoders are much lower in complexity compared to conventional floating-point decoders such as the belief propagation (BP) decoder, but they have the potential to outperform BP. The messages utilized by the decoders assume values (or levels) from a finite discrete set. We discuss the implementation aspects as well as describe the underlying philosophy in designing these decoders. We also provide results to show that in some cases, only 3 bits are required in the proposed decoders to outperform floating-point BP.

•Dec 1, 2010•0 citations

Modern-Driven Deep Learning for Belief Propagation LDPC Decoding

Yiduo Tang, Lin Zhou, Shuying Zhang +1 more

Smart innovation, systems and technologies•Jan 1, 2022•0 citations

Greedy Belief Propagation Algorithm for Low-Complexity LDPC Decoding

Yimo Zhen, Jinhui Chen, Zhan Zhang Xu +1 more

Lecture notes in networks and systems•Jan 1, 2025•0 citations

Design and Decoding of Irregular LDPC Codes Based on Discrete Message Passing

Michael Meidlinger, Gerald Matz, Andreas Peter Burg

We consider discrete message passing (MP) decoding of low-density parity check (LDPC) codes based on information-optimal symmetric look-up table (LUT). A link between discrete message labels and the associated log-likelihood ratio values (defined in terms of density evolution distributions) is established. This link gives rise to an algebraic structure on the message labels and leads to an interpretation of LUT decoding as a form of quantized belief propagation. We then exploit the algebraic structure for low-complexity LUT decoder designs. Our LUT decoding framework is the first to also apply to irregular LDPC codes by taking into account the degree distribution in a joint LUT design. We exploit the relation between LUT decoding and belief propagation to obtain stability conditions and irregular LDPC code designs optimized for LUT decoding. The resulting decoders outperform floating-point precision min-sum decoders at LUT resolutions as low as 3 bit s for regular codes and 4 bits for irregular codes.

IEEE Transactions on Communications•Sep 28, 2019•27 citations
Optimal quantizers for channel output are especially necessary for very high speed and memory-cell sensing applications where high-precision analog-to-digital converters are not available. This paper investigates a method to find optimal output quantizers for a binary input (BI) additive white Gaussian noise (AWGN) channel when regular low-density parity-check (LDPC) codes are used with belief-propagation (BP) decoding. The optimal quantizers are found by uni-parametric and multi-parametric optimization methods based on the discretized density evolution (DE). The capacity of various LDPC code ensembles are also provided with the BI-AWGN channel outputs quantized using these optimal quantizers. It is demonstrated that only 3 bits of quantization precision performs almost within 0.1 dB of the infinite precision channel output. The effect of the code rate and the degree distribution of LDPC codes on the optimal quantization boundaries is analyzed.
We present a new class of finite-precision decoders for low-density parity-check (LDPC) codes. These decoders are much lower in complexity compared to conventional floating-point decoders such as the belief propagation (BP) decoder, but they have the potential to outperform BP. The messages utilized by the decoders assume values (or levels) from a finite discrete set. We discuss the implementation aspects as well as describe the underlying philosophy in designing these decoders. We also provide results to show that in some cases, only 3 bits are required in the proposed decoders to outperform floating-point BP.
We consider discrete message passing (MP) decoding of low-density parity check (LDPC) codes based on information-optimal symmetric look-up table (LUT). A link between discrete message labels and the associated log-likelihood ratio values (defined in terms of density evolution distributions) is established. This link gives rise to an algebraic structure on the message labels and leads to an interpretation of LUT decoding as a form of quantized belief propagation. We then exploit the algebraic structure for low-complexity LUT decoder designs. Our LUT decoding framework is the first to also apply to irregular LDPC codes by taking into account the degree distribution in a joint LUT design. We exploit the relation between LUT decoding and belief propagation to obtain stability conditions and irregular LDPC code designs optimized for LUT decoding. The resulting decoders outperform floating-point precision min-sum decoders at LUT resolutions as low as 3 bit s for regular codes and 4 bits for irregular codes.