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)

Improved bit flipping decoding of low-density parity check codes

N. Miladinovic, M.P.C. Fossorier

Published Jun 25, 2003• 7 citations
Publisher

Abstract

A new method for improving bit flipping decoding of LDPC codes is presented. In this method, bits with a number of unsatisfied check sums larger than a predetermined threshold are flipped with a probability p which is determined based on the code considered. With a proper choice of p, the proposed improved bit flipping algorithm achieves a gain not only in performance, but also in the average decoding time for SNR values of interest with respect to p=1.

DOI
10.1109/isit.2002.1023501

Related papers

Improved Bit-Flipping Decoding of Low-Density Parity-Check Codes

N. Miladinovic, M.P.C. Fossorier

In this correspondence, a new method for improving hard-decision bit-flipping decoding of low-density parity-check (LDPC) codes is presented. Bits with a number of unsatisfied check sums larger than a predetermined threshold are flipped with a probability p /spl les/ 1 which is independent of the code considered. The probability p is incremented during decoding according to some rule. With a proper choice of the initial p, the proposed improved bit-flipping (BF) algorithm achieves gain not only in performance, but also in average decoding time for signal-to-noise ratio (SNR) values of interest with respect to p = 1.

IEEE Transactions on Information Theory•Apr 1, 2005•85 citations

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

Improved Bit-Flipping Method for Decoding Structured Low-Density Parity-Check Codes

Meiling Zhang

An improved bit-flipping(BF) algorithm with low complexity for decoding structured low-density parity-check codes(LDPC) is proposed to improve the performance of the hard-decision BF algorithm.The hard-decision bits are divided into two groups based on the magnitudes of the received symbols,and at each iteration,the proposed algorithm can flip more than one bit with using two thresholds,and the flipping error probability is effectively decreased.The improved BF algorithm requires some real number comparisons before iterations and requires only logical operations during the iterations.Compared with the weighted bit-flipping algorithm and its modifications,the new method is with significantly lower complexity.Simulations show that the proposed algorithm is provided with very fast convergence speed and excellent performance with significantly low complexity.

Beijing Youdian Xueyuan xuebao•Jan 1, 2012•0 citations

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

Meiling Zhang

An improved iterative bit-flipping(BF) algorithm adapted for decoding low-density parity-check(LDPC) codes is proposed to improve the performance of the hard-decision BF decoding algorithm.The new algorithm uses an alternating threshold pattern to determine the bits whether to be flipped or not,and the flipping error probability is effectively decreased.Simulation results show that compared with BF algorithm,the improved BF algorithm improves both the error-correction performance and the convergence speed while maintaining the low computational complexity.

Telecommunication Engineering•Jan 1, 2012•0 citations

Weighted candidate bit based bit-flipping decoding algorithms for LDPC codes

Zhu Qing, Lenan Wu

In order to improve the bit-flipping (BF) decoding algorithms, a weighted hard-decision based BF decoding algorithm for low-density parity-check (LDPC) codes is presented, in which the weights of variable-nodes are employed. A new metric is defined for the weight of candidate bits not only in unsatisfied parity check equations but also in satisfied ones. The connection between min-sum decoding algorithm and the proposed algorithm is presented. Simulation results show that the new decoding algorithm can provide better FER performance and faster convergence speed than the original candidate bit based bit-flipping (CBBF) algorithm.

International Conference on Consumer Electronics, Communications and Networks (CECNet)•Nov 1, 2013•4 citations

A Modified Bit-Flipping Decoding Algorithm for Low-Density Parity-Check Codes

Telex M. N. Ngatched, Fambirai Takawira, Martin Bossert

In this paper, a modified bit-flipping decoding algorithm for low-density parity-check (LDPC) codes is proposed. Both improvement in performance and reduction in decoding delay are observed by flipping multiple bits in each iteration. Our studies show that the proposed algorithm achieves an appealing tradeoff between performance and complexity for many constructions of LDPC codes.

International Conference on Communications•Jun 1, 2007•11 citations
A new method for improving bit flipping decoding of LDPC codes is presented. In this method, bits with a number of unsatisfied check sums larger than a predetermined threshold are flipped with a probability p which is determined based on the code considered. With a proper choice of p, the proposed improved bit flipping algorithm achieves a gain not only in performance, but also in the average decoding time for SNR values of interest with respect to p=1.
In this correspondence, a new method for improving hard-decision bit-flipping decoding of low-density parity-check (LDPC) codes is presented. Bits with a number of unsatisfied check sums larger than a predetermined threshold are flipped with a probability p /spl les/ 1 which is independent of the code considered. The probability p is incremented during decoding according to some rule. With a proper choice of the initial p, the proposed improved bit-flipping (BF) algorithm achieves gain not only in performance, but also in average decoding time for signal-to-noise ratio (SNR) values of interest with respect to p = 1.
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.
An improved bit-flipping(BF) algorithm with low complexity for decoding structured low-density parity-check codes(LDPC) is proposed to improve the performance of the hard-decision BF algorithm.The hard-decision bits are divided into two groups based on the magnitudes of the received symbols,and at each iteration,the proposed algorithm can flip more than one bit with using two thresholds,and the flipping error probability is effectively decreased.The improved BF algorithm requires some real number comparisons before iterations and requires only logical operations during the iterations.Compared with the weighted bit-flipping algorithm and its modifications,the new method is with significantly lower complexity.Simulations show that the proposed algorithm is provided with very fast convergence speed and excellent performance with significantly low complexity.
An improved iterative bit-flipping(BF) algorithm adapted for decoding low-density parity-check(LDPC) codes is proposed to improve the performance of the hard-decision BF decoding algorithm.The new algorithm uses an alternating threshold pattern to determine the bits whether to be flipped or not,and the flipping error probability is effectively decreased.Simulation results show that compared with BF algorithm,the improved BF algorithm improves both the error-correction performance and the convergence speed while maintaining the low computational complexity.
In order to improve the bit-flipping (BF) decoding algorithms, a weighted hard-decision based BF decoding algorithm for low-density parity-check (LDPC) codes is presented, in which the weights of variable-nodes are employed. A new metric is defined for the weight of candidate bits not only in unsatisfied parity check equations but also in satisfied ones. The connection between min-sum decoding algorithm and the proposed algorithm is presented. Simulation results show that the new decoding algorithm can provide better FER performance and faster convergence speed than the original candidate bit based bit-flipping (CBBF) algorithm.