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

Advanced decoding technics for law density parity check codes decoding

Allaoui, Y.

Published Jan 1, 2004• 0 citations
Publisher

Abstract

Error-correcting codes based on very sparse matrices provide the best performance to date. We will focus on improving the decoding of Low Density Parity Checks Codes by examining a new variant of belief propagation for this problem. This new variant is based on techniques such as time averaging and prior biasing. Results obtained by extensive simulations show that, well combined, these techniques bring a modest improvement to BP decoding performance. We also studied the possibility of parallelism, which consists of breaking the algorithm in independent pieces that can be solved simultaneously on different computer nodes. But the time spent in inter-communication between the different machines slows the process and prevent the parallelisation to be as fast as expected.

DOI
10.48780/publications.aston.ac.uk.00021417

Related papers

A comprehensive Study of Decoding Algorithms for Low Density Parity-Check(LDPC)

C S Anil Kumar, M Vedhashri, L Vanditha +2 more

The near-capacity performance and effective decoding algorithms of Low-Density Parity-Check (LDPC) codes have made them a mainstay of contemporary error correction. With an emphasis on iterative techniques like the Belief Propagation (BP) algorithm, the Min-Sum algorithm, and their variations, this paper offers a thorough analysis of decoding algorithms for LDPC codes. We investigate the trade-offs between various algorithmic techniques’ computational complexity, decoding latency, and error correction performance. Particular focus is placed on new methods and hardware-friendly algorithms that are tailored for next-generation communication systems, such 5 G and beyond.

International Conference on Knowledge Engineering and Communication Systems (ICKECS)•Apr 28, 2025•0 citations

Check-Belief Propagation Decoding of LDPC Codes

Wu Guan, Liping Liang

Variant belief propagation (BP) algorithms are applied to low-density parity-check (LDPC) codes. However, conventional decoders suffer from a large resource consumption due to gathering messages from all the neighbour variable-nodes and/or check-nodes through cumulative calculations. In this paper, a check-belief propagation (CBP) decoding algorithm is proposed. Check-belief is used as the probability that the corresponding parity-check is satisfied. All check-beliefs are iteratively enlarged in a sequential recursive order, and successful decoding will be achieved after the check-beliefs are all big enough. Compared to previous algorithms employing a large number of cumulative calculations to gather all the neighbour messages, CBP decoding can renew each check-belief by propagating it from one check-node to another through only one variable-node, resulting in a low complexity decoding with no cumulative calculations. The simulation results and analyses show that the CBP algorithm provides little error-rate performance loss in contrast with the previous BP algorithms, but consumes much fewer calculations and memories than them. It earns a big benefit in terms of complexity.

arXiv:2305.05286•IEEE Transactions on Communications•Aug 24, 2023•18 citations

Improvements in belief-propagation decoding based on averaging information from decoder and correction of clusters of nodes

Nedeljko Varnica, M.P.C. Fossorier

In this letter we provide several methods to improve belief-propagation (BP) decoding of low-density parity-check codes. The methods use additional processing of the decoded information during the decoding process and are grouped into two categories. The first category is useful in the waterfall performance region and is based on processing averaged information obtained from the decoder. Several choices of the feedback information utilized in additional processing are introduced. The second category is useful in the error-floor performance region and is based on fixing clusters of symbols simultaneously, again utilizing the information obtained by monitoring the decoder. We demonstrate on a code example that our methods achieve sizeable gains compared to the original BP decoder

IEEE Communications Letters•Dec 1, 2006•17 citations

Reduced-complexity belief propagation decoding for low-density parity-check codes

Junli Li, X.D. Zhang

A novel dual-min-sum decoding algorithm for low-density parity-check codes is proposed. The proposed algorithm simplifies the check-node updates and thus reduces the computational complexity of the belief propagation (BP) algorithm significantly. Simulation results show that the proposed algorithm can achieve an error performance very close to that of the BP algorithm.

Electronics Letters•Jan 30, 2008•12 citations

Belief revision and small loops in Gallager-type error-correcting codes

Doubez, M.

Gallager-type error-correcting codes are low density parity check codes (LDPC) which may in specific case nearly saturate Shannon’s bound. They are based on the construction of two very sparse matrices, various structures of which have been studied in recent years. We will mainly focus here on constructions that have recently been studied by Kanter and Saad. The aim of this project is to examine the performance of two different decoding LDPC algorithms, belief propagation and belief revision within this framework, as well as that of different coding methods (MN vs. Gallager codes).We will also look at the effect of removing small loops in the matrices on the code’s performance.

•Jan 1, 2000•0 citations

Belief-propagation with information correction: improved near maximum-likelihood decoding of low-density parity-check codes

Nedeljko Varnica, M.P.C. Fossorier

We propose an improved belief-propagation (BP) decoder for low-density parity-check (LDPC) codes based on channel information correction. We show that our algorithm achieves sizeable performance gains (in waterfall and error floor regions) compared to the standard BP decoder. We verify by examples that the proposed decoder almost achieves the maximum-likelihood decoding performance for short LDPC codes

IEEE International Symposium on Information Theory (ISIT)•Dec 23, 2004•18 citations
Error-correcting codes based on very sparse matrices provide the best performance to date. We will focus on improving the decoding of Low Density Parity Checks Codes by examining a new variant of belief propagation for this problem. This new variant is based on techniques such as time averaging and prior biasing. Results obtained by extensive simulations show that, well combined, these techniques bring a modest improvement to BP decoding performance. We also studied the possibility of parallelism, which consists of breaking the algorithm in independent pieces that can be solved simultaneously on different computer nodes. But the time spent in inter-communication between the different machines slows the process and prevent the parallelisation to be as fast as expected.
The near-capacity performance and effective decoding algorithms of Low-Density Parity-Check (LDPC) codes have made them a mainstay of contemporary error correction. With an emphasis on iterative techniques like the Belief Propagation (BP) algorithm, the Min-Sum algorithm, and their variations, this paper offers a thorough analysis of decoding algorithms for LDPC codes. We investigate the trade-offs between various algorithmic techniques’ computational complexity, decoding latency, and error correction performance. Particular focus is placed on new methods and hardware-friendly algorithms that are tailored for next-generation communication systems, such 5 G and beyond.
Variant belief propagation (BP) algorithms are applied to low-density parity-check (LDPC) codes. However, conventional decoders suffer from a large resource consumption due to gathering messages from all the neighbour variable-nodes and/or check-nodes through cumulative calculations. In this paper, a check-belief propagation (CBP) decoding algorithm is proposed. Check-belief is used as the probability that the corresponding parity-check is satisfied. All check-beliefs are iteratively enlarged in a sequential recursive order, and successful decoding will be achieved after the check-beliefs are all big enough. Compared to previous algorithms employing a large number of cumulative calculations to gather all the neighbour messages, CBP decoding can renew each check-belief by propagating it from one check-node to another through only one variable-node, resulting in a low complexity decoding with no cumulative calculations. The simulation results and analyses show that the CBP algorithm provides little error-rate performance loss in contrast with the previous BP algorithms, but consumes much fewer calculations and memories than them. It earns a big benefit in terms of complexity.
In this letter we provide several methods to improve belief-propagation (BP) decoding of low-density parity-check codes. The methods use additional processing of the decoded information during the decoding process and are grouped into two categories. The first category is useful in the waterfall performance region and is based on processing averaged information obtained from the decoder. Several choices of the feedback information utilized in additional processing are introduced. The second category is useful in the error-floor performance region and is based on fixing clusters of symbols simultaneously, again utilizing the information obtained by monitoring the decoder. We demonstrate on a code example that our methods achieve sizeable gains compared to the original BP decoder
Gallager-type error-correcting codes are low density parity check codes (LDPC) which may in specific case nearly saturate Shannon’s bound. They are based on the construction of two very sparse matrices, various structures of which have been studied in recent years. We will mainly focus here on constructions that have recently been studied by Kanter and Saad. The aim of this project is to examine the performance of two different decoding LDPC algorithms, belief propagation and belief revision within this framework, as well as that of different coding methods (MN vs. Gallager codes).We will also look at the effect of removing small loops in the matrices on the code’s performance.