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

Information technology newsletter

Soft-decision decoding algorithm hased on reliability for LDPC code

Guangxi Zhu

Published Jan 1, 2004• 0 citations
OpenAlex

Abstract

A hard-decision decoding algorithm based on parity-check sum for LDPC code was first described, and then a soft-decision decoding algorithm based on parity-check sum and symbol reliability was proposed. The soft-decision decoding algorithm incorporates received symbol reliability information and a simple taboo function that avoids repeated flipping of the same bit. A maximum votes queue algorithm for the numbers of which the parity-check functions were not satisfied was applied to quickly search the flipping bit. Approaches above all were used to improve the performance of the flipping-bit algorithm based on parity-check sum.

Related papers

Loop Detection Based on Bit-Flipping Decoding Algorithm for LDPC Codes

Zhong Xun Wang, Fang Qiang Zhu, Li Liu +1 more

In this paper, we introduce a new bit-flipping decoding algorithm for low-density parity-check codes based on loop detection mechanism, which is an extension to soft-decision decoding. This decoding algorithm's performance has been significantly improved by introducing a loop detection mechanism for the failed flipping bit and leading into the soft-decision about the reliability measure of the received symbols. Theoretical analysis shows that the complexity of this algorithm is lower. Some simulation results are given, which show that compared with other known kinds of bit-flipping decoding algorithms for LDPC codes, this new decoding on the additive white Gaussian noise channel offer excellent performance.

Advanced materials research•Jul 1, 2011•0 citations

An Efficient Decoding Algorithm for Low-Density Parity-Check Codes

Yang Cao

We present a simple decoding algorithm that modifies soft bit-flipping algorithm for decoding LDPC codes. In our method, a new parameter is explored to distinguish the variables (symbols) belonging to the same number of unsatisfied constraints. A token is also assigned in the method to avoid repeated flipping of the same variable, rather than using a constant taboo length. Our scheme shows a similar computational load as the taboo-based algorithm, while having a similar decoding performance as the belief propagation algorithm.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•May 1, 2005•1 citation

An Improved Bit-flipping Decoding Algorithm for Low-density Parity-check Codes

Zhu Jin-kang

An improved bit-flipping decoding algorithm is proposed for low-density parity-check(LDPC) codes in this paper.Two influences on error probabilities of code bits are considered: the influence of the number of code bits included in an unsatisfied check,and the influence of the number of unsatisfied checks of each code bit.No soft information is required for decoding.Simulation results show that improvement on performance is observed for the proposed algorithm,and it provides better performance over several soft-decision bit-flipping decoding algorithms for LDPC codes with large girth.

Wireless Communication Technology•Jan 1, 2008•0 citations

Check Reliability Based Bit-Flipping Decoding Algorithms for LDPC Codes

Chi-Yuan Chang, Yu T. Su, Chen, Yu-Liang +1 more

We introduce new reliability definitions for bit and check nodes. Maximizing global reliability, which is the sum reliability of all bit nodes, is shown to be equivalent to minimizing a decoding metric which is closely related to the maximum likelihood decoding metric. We then propose novel bit-flipping (BF) decoding algorithms that take into account the check node reliability. Both hard-decision (HD) and soft-decision (SD) versions are considered. The former performs better than the conventional BF algorithm and, in most cases, suffers less than 1 dB performance loss when compared with some well known SD BF decoders. For one particular code it even outperforms those SD BF decoders. The performance of the SD version is superior to that of SD BF decoders and is comparable to or even better than that of the sum-product algorithm (SPA). The latter is achieved with a complexity much less than that required by the SPA.

arXiv:1001.2503•Jan 14, 2010•5 citations

An efficient bit-flipping decoding algorithm for LDPC codes

Tso-Cho Chen

In this paper, a new method for improving hard-decision bit-flipping (BF) decoding is proposed for low-density parity-check codes. The flipping criterion is derived theoretically from the soft-decision belief-propagation decoding algorithm. The proposed BF decoding algorithm is channel independent and is improved by introducing a more efficient method for computing the reliability of the parity checks. Extensive simulations are provided to demonstrate the efficiency of the proposed algorithm. Simulation results show that the proposed algorithm can achieve about 1.5dB coding gain improvement at BER = 5×10−6while reducing up to 48% iterations for decoding and maintaining low decoding complexity, compared with the conventional weighted BF algorithm.

Cross Strait Quad-Regional Radio Science and Wireless Technology Conference (CSQRWC)•Jul 1, 2012•6 citations

Majority decision based weighted symbol-flipping decoding for nonbinary LDPC codes

Bing Liu, Jun Gao, Gaoqi Dou +1 more

A new low-complexity symbol-flipping algorithm based on majority decision to decode nonbinary low-density parity-check (LDPC) codes is proposed. The decoding procedure updates iteratively the hard-decision received symbol vector in search of a valid codeword in the symbol vector space. Only one symbol is changed in each iteration, and symbol flipping function combines the number of failed checks and reliability of the received bits and calculated symbols. Flipped symbol position is determined by majority decision and flipped value is calculated by channel output. And an optional mechanism to avoid infinite loops in high Galois field search is also proposed. Our studies show that the algorithm achieves an appealing tradeoff between performance and complexity over relatively low Galois field for short to medium code length.

International Conference on Future Computer and Communication•Jan 1, 2010•4 citations
A hard-decision decoding algorithm based on parity-check sum for LDPC code was first described, and then a soft-decision decoding algorithm based on parity-check sum and symbol reliability was proposed. The soft-decision decoding algorithm incorporates received symbol reliability information and a simple taboo function that avoids repeated flipping of the same bit. A maximum votes queue algorithm for the numbers of which the parity-check functions were not satisfied was applied to quickly search the flipping bit. Approaches above all were used to improve the performance of the flipping-bit algorithm based on parity-check sum.
In this paper, we introduce a new bit-flipping decoding algorithm for low-density parity-check codes based on loop detection mechanism, which is an extension to soft-decision decoding. This decoding algorithm's performance has been significantly improved by introducing a loop detection mechanism for the failed flipping bit and leading into the soft-decision about the reliability measure of the received symbols. Theoretical analysis shows that the complexity of this algorithm is lower. Some simulation results are given, which show that compared with other known kinds of bit-flipping decoding algorithms for LDPC codes, this new decoding on the additive white Gaussian noise channel offer excellent performance.
We present a simple decoding algorithm that modifies soft bit-flipping algorithm for decoding LDPC codes. In our method, a new parameter is explored to distinguish the variables (symbols) belonging to the same number of unsatisfied constraints. A token is also assigned in the method to avoid repeated flipping of the same variable, rather than using a constant taboo length. Our scheme shows a similar computational load as the taboo-based algorithm, while having a similar decoding performance as the belief propagation algorithm.
An improved bit-flipping decoding algorithm is proposed for low-density parity-check(LDPC) codes in this paper.Two influences on error probabilities of code bits are considered: the influence of the number of code bits included in an unsatisfied check,and the influence of the number of unsatisfied checks of each code bit.No soft information is required for decoding.Simulation results show that improvement on performance is observed for the proposed algorithm,and it provides better performance over several soft-decision bit-flipping decoding algorithms for LDPC codes with large girth.
We introduce new reliability definitions for bit and check nodes. Maximizing global reliability, which is the sum reliability of all bit nodes, is shown to be equivalent to minimizing a decoding metric which is closely related to the maximum likelihood decoding metric. We then propose novel bit-flipping (BF) decoding algorithms that take into account the check node reliability. Both hard-decision (HD) and soft-decision (SD) versions are considered. The former performs better than the conventional BF algorithm and, in most cases, suffers less than 1 dB performance loss when compared with some well known SD BF decoders. For one particular code it even outperforms those SD BF decoders. The performance of the SD version is superior to that of SD BF decoders and is comparable to or even better than that of the sum-product algorithm (SPA). The latter is achieved with a complexity much less than that required by the SPA.
In this paper, a new method for improving hard-decision bit-flipping (BF) decoding is proposed for low-density parity-check codes. The flipping criterion is derived theoretically from the soft-decision belief-propagation decoding algorithm. The proposed BF decoding algorithm is channel independent and is improved by introducing a more efficient method for computing the reliability of the parity checks. Extensive simulations are provided to demonstrate the efficiency of the proposed algorithm. Simulation results show that the proposed algorithm can achieve about 1.5dB coding gain improvement at BER = 5×10−6while reducing up to 48% iterations for decoding and maintaining low decoding complexity, compared with the conventional weighted BF algorithm.
A new low-complexity symbol-flipping algorithm based on majority decision to decode nonbinary low-density parity-check (LDPC) codes is proposed. The decoding procedure updates iteratively the hard-decision received symbol vector in search of a valid codeword in the symbol vector space. Only one symbol is changed in each iteration, and symbol flipping function combines the number of failed checks and reliability of the received bits and calculated symbols. Flipped symbol position is determined by majority decision and flipped value is calculated by channel output. And an optional mechanism to avoid infinite loops in high Galois field search is also proposed. Our studies show that the algorithm achieves an appealing tradeoff between performance and complexity over relatively low Galois field for short to medium code length.