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 Communications Letters

An improvement on the modified weighted bit flipping decoding algorithm for LDPC codes

Ming Yan Jiang, Chunming Zhao, Zhihua Shi, Yu Chen

Published Sep 1, 2005• 153 citations
Publisher

Abstract

We present a major improvement to the modified weighted bit flipping (MWBF) decoding algorithm for low density parity-check (LDPC) codes. We improve the flipping criterion by introducing a more efficient method for computing the reliability of the parity checks. We derive an approximate theoretical expression for the weighting factor and demonstrate its consistency with simulation results. The improved MWBF algorithm achieves a noticeable gain over the MWBF algorithm with only a modest increase in computational complexity.

DOI
10.1109/lcomm.2005.1506712

Related papers

Sum of the magnitude based weighted bit-flipping decoding algorithms for LDPC codes

Zhang Gao-yua

Two simple and efficient weighted bit flipping(WBF)decoding algorithms for low density paritycheck(LDPC)codes are proposed,in which the sum of the variable nodes' magnitude is introduced to compute the reliability of the parity checks.Simulation results shows that the performance of one of the improved scheme is better than that of traditional WBF and modified WBF(MWBF)algorithms about 1.65dB and 1.31dB at BER of 10-5 over an additive white Gaussian noise channel,respectively,while the average number of decoding iterations is significantly reduced.

Systems engineering and electronics•Jan 1, 2014•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•6 citations

Offset adjustment based weighted bit-flipping decoding algorithm for LDPC codes

Zhang Gao-yua

Extensive simulations show that for some low density parity-check(LDPC)codes of low row/colum weight,the modified sum of the magnitude based weighted bit flipping(MSMWBF)decoding algorithm performs extraordinarily well.However,this dose not hold when it comes to large row/colum weight finite-geometry LDPC codes,which is first theoretically analyzed.Secondly,improvement in performance is observed for large row/colum weight LDPC codes by considering an additive offset term for the parity-check-equation reliability of the above algorithm.Simulation results show that the performance of the improved scheme is better than that of the MSMWBF algorithm about 0.63 dB at bit-error rate of 10-5 over the additive white Gaussian noise channel with only a modest increase in computational complexity.

Systems engineering and electronics•Jan 1, 2014•0 citations

A Modification to Weighted Bit-Flipping Decoding Algorithm for LDPC Codes Based on Reliability Adjustment

D. Qian, M. Jiang, Chihang Zhao +1 more

In this paper, a modification to the weighted bit- flipping (WBF) decoding algorithm for low-density parity-check (LDPC) codes is proposed. This modification, based on the adjustment in reliabilities of the check sums during iterative decoding, can be applied to various WBF algorithms. Our studies show that the modification can be achieved with a small increase in complexity, but leads to an appealing improvement in error performance.

International Conference on Communications•Jan 1, 2008•4 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

A modified weighted bit-flipping algorithm for LDPC codes

Haigang Zhang, Dongfeng Yuan, Cheng‐Xiang Wang

In this paper, a modified weighted bit-flipping (WBF) algorithm is proposed for finite geometry low-density parity-check (FG-LDPC) codes. The calculation for the flipping function in the new method includes all the elements in sum product algorithm (SPA) instead of the minimum one in most existing methods. Simulation results show that the proposed method exhibits better performance than the best method available in the literature so far. The performances of different algorithms are also considered in random constructed LDPC codes. The reliability ratio based WBF (RRWBF) method performs the best in this kind of codes and the proposed method performs very closely to the RRWBF method. The decoding complexities for both FG-LDPC and random constructed LDPC are also analyzed.

IET International Conference on Wireless, Mobile and Multimedia Networks (ICWMMN)•Jan 1, 2008•1 citation
We present a major improvement to the modified weighted bit flipping (MWBF) decoding algorithm for low density parity-check (LDPC) codes. We improve the flipping criterion by introducing a more efficient method for computing the reliability of the parity checks. We derive an approximate theoretical expression for the weighting factor and demonstrate its consistency with simulation results. The improved MWBF algorithm achieves a noticeable gain over the MWBF algorithm with only a modest increase in computational complexity.
Two simple and efficient weighted bit flipping(WBF)decoding algorithms for low density paritycheck(LDPC)codes are proposed,in which the sum of the variable nodes' magnitude is introduced to compute the reliability of the parity checks.Simulation results shows that the performance of one of the improved scheme is better than that of traditional WBF and modified WBF(MWBF)algorithms about 1.65dB and 1.31dB at BER of 10-5 over an additive white Gaussian noise channel,respectively,while the average number of decoding iterations is significantly reduced.
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.
Extensive simulations show that for some low density parity-check(LDPC)codes of low row/colum weight,the modified sum of the magnitude based weighted bit flipping(MSMWBF)decoding algorithm performs extraordinarily well.However,this dose not hold when it comes to large row/colum weight finite-geometry LDPC codes,which is first theoretically analyzed.Secondly,improvement in performance is observed for large row/colum weight LDPC codes by considering an additive offset term for the parity-check-equation reliability of the above algorithm.Simulation results show that the performance of the improved scheme is better than that of the MSMWBF algorithm about 0.63 dB at bit-error rate of 10-5 over the additive white Gaussian noise channel with only a modest increase in computational complexity.
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 modified weighted bit-flipping (WBF) algorithm is proposed for finite geometry low-density parity-check (FG-LDPC) codes. The calculation for the flipping function in the new method includes all the elements in sum product algorithm (SPA) instead of the minimum one in most existing methods. Simulation results show that the proposed method exhibits better performance than the best method available in the literature so far. The performances of different algorithms are also considered in random constructed LDPC codes. The reliability ratio based WBF (RRWBF) method performs the best in this kind of codes and the proposed method performs very closely to the RRWBF method. The decoding complexities for both FG-LDPC and random constructed LDPC are also analyzed.