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

Journal of Beijing Jiaotong University

Check of Reliability-Based Bit-Flipping Decoding Algorithm for LDPC Codes

Xia Chen

Published Jan 1, 2008• 0 citations
OpenAlex

Abstract

In this paper,a check of reliability-based bit-flipping(Check Reliability-based Bit Flipping,CR-BF) decoding algorithm for Low Density Parity Check(LDPC) Code is proposed.The CR-BF algorithm flips bits based on the reliability of parity-check equations.Then the number of error parity-check equations is considered to flip more than 1 bit in each iteration.Simulation results show that the proposed algorithms converge faster and achieve better performance.

Related papers

Self reliability based weighted bit-flipping decoding for low-density parity-check codes

Jin Sha, Minglun Gao, Zhongjin Zhang +2 more

Abstract- Low Density Parity Check (LDPC) codes can be decoded in various ways, namely the Bit-Flipping (BF) algorithm, the Weighted BF algorithm (WBF) , the Belief Propagation (BP) algorithm and so on. These algorithms provide a wide range of tradeoffs among decoding complexity, decoding speed, and error rate performance. In this paper, a novel self-reliability-based weighted bit-flipping decoding scheme for low-density parity-check codes is proposed. Improvement in performance is observed in comparison with the modified weighted bit-flipping decoding scheme, and the decoding complexity can be significantly reduced as well. Key-Words:- Low-density parity-check (LDPC) codes, decoding algorithm, bit flipping, self reliability

International Conference on Instrumentation, Measurement, Circuits and Systems•Apr 16, 2006•3 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•5 citations

An Improved Multi-bit Flipping Algorithm for LDPC Decoding

Lan Tang

The bit-flipping(BF) algorithm of low density parity check(LDPC) code has low computation complexity and great practicability.On the basis of studying simple BF,WBF and RRWBF,an improved BF algorithm is proposed on considering the reliability ratio and absolute value of symbol.The proposed algorithm flips more than one bit in each iteration.Simulation results indicate that compared with RRWBF,the error rate of the proposed algorithm with 5 dB is improved from 10-3 to 10-4.

Modern Electronics Technique•Jan 1, 2011•0 citations

Reliability Adjustment Weighted Bit-Flipping Decoding for Low-Density Parity-Check Codes

Shengpei Ding, Jiongcheng Li, Heng-hui XIAO +1 more

In this paper, we propose reliability adjustment weighted bit-flipping (RA-WBF) decoding algorithm for low density parity-check (LDPC) codes. By adjusting the reliability of received symbols during iterative decoding, the proposed algorithm can offer better tradeoff between performance, convergence speed and computational complexity. Furthermore, this improvement can easily be extended to other variations of weighted bit-flipping decoding algorithm and obtain noticeable improvement in error performance. Simulation results are shown to verify our conclusions.

International Conference on Computational Intelligence and Security (CIS)•Dec 1, 2013•0 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•7 citations

Two-bit bit-flipping algorithm for decoding low-density parity-check codes based on syndrome weight

Hua Li, Liangjun Xiang, Linhua Zheng

In this paper, a novel two-bit bit-flipping (BF) decoding algorithm is proposed for low-density parity-check (LDPC) codes. The proposed algorithm flips two bits per iteration based on the syndrome-weight metric. Since the algorithm requires only logical operations during the iterations. The proposed tow-bit BF algorithm has low complexity. Simulation results show that the proposed algorithm has faster convergence speed and about 0.2 dB gain compared to standard BF decoding algorithm.

International Conference on Optical Communications and Networks (ICOCN)•Sep 1, 2016•0 citations
In this paper,a check of reliability-based bit-flipping(Check Reliability-based Bit Flipping,CR-BF) decoding algorithm for Low Density Parity Check(LDPC) Code is proposed.The CR-BF algorithm flips bits based on the reliability of parity-check equations.Then the number of error parity-check equations is considered to flip more than 1 bit in each iteration.Simulation results show that the proposed algorithms converge faster and achieve better performance.
Abstract- Low Density Parity Check (LDPC) codes can be decoded in various ways, namely the Bit-Flipping (BF) algorithm, the Weighted BF algorithm (WBF) , the Belief Propagation (BP) algorithm and so on. These algorithms provide a wide range of tradeoffs among decoding complexity, decoding speed, and error rate performance. In this paper, a novel self-reliability-based weighted bit-flipping decoding scheme for low-density parity-check codes is proposed. Improvement in performance is observed in comparison with the modified weighted bit-flipping decoding scheme, and the decoding complexity can be significantly reduced as well. Key-Words:- Low-density parity-check (LDPC) codes, decoding algorithm, bit flipping, self reliability
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.
In this paper, we propose reliability adjustment weighted bit-flipping (RA-WBF) decoding algorithm for low density parity-check (LDPC) codes. By adjusting the reliability of received symbols during iterative decoding, the proposed algorithm can offer better tradeoff between performance, convergence speed and computational complexity. Furthermore, this improvement can easily be extended to other variations of weighted bit-flipping decoding algorithm and obtain noticeable improvement in error performance. Simulation results are shown to verify our conclusions.
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.