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

Dianzi Ke-ji Daxue xuebao

Simple and Efficient Weighted Bit-Flipping Decoding Algorithm for LDPC Codes

Zhang Gao-yua

Published Jan 1, 2015• 0 citations
OpenAlex

Abstract

An extrinsic reliability adjustment(ERA) scheme of low-density parity-check(LDPC) codes is proposed in this paper based on theoretical analysis of the physical significance for two previous weighted bit-flipping(WBF) algorithms, which have less complexity with poor error correcting performance. The novel scheme significantly improves the check-node realiability accuracy of the two previous WBF algorithms. Therefore, the flipping efficiency of the novel decoding algorithm is increased. The extensive simulations prove that the ERA scheme can obviously improves the performance of the two previous WBF algorithms and a great decoding gain is obtained over an AWGN channel, which achieves an appealing tradeoff between performance and complexity.

Related papers

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

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

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

Reliability Ratio Based Weighted Bit-Flipping Decoding for LDPC codes

Feng Guo, L. Hanzo

In this contribution, a novel reliability-ratio based weighted bit-flipping (RRWBF) algorithm is proposed for decoding low density parity check (LDPC) codes. The RRWBF algorithm proposed is benchmarked against the conventional weighted bit-flipping (WBF) algorithm and the improved weighted bit-flipping (IWBF) algorithm. More than 1 and 2 dB coding gain was achieved at a BER of 10/sup -5/ while invoking the RRWBF algorithm in comparison to the two benchmarking schemes, when communicating over an AWGN and an uncorrelated Rayleigh channel, respectively. Furthermore, the decoding complexity of the proposed RRWBF algorithm is maintained at the same level as that of the conventional WBF algorithm.

IEEE Vehicular Technology Conference•Dec 10, 2005•15 citations

A New Reliability Ratio Weighted Bit Flipping Algorithm for Decoding LDPC Codes

Chakir Aqil, Ismail Akharraz, Abdelaziz Ahaitouf

In this study, we propose a “New Reliability Ratio Weighted Bit Flipping” (NRRWBF) algorithm for Low‐Density Parity‐Check (LDPC) codes. This algorithm improves the “Reliability Ratio Weighted Bit Flipping” (RRWBF) algorithm by modifying the reliability ratio. It surpasses the RRWBF in performance, reaching a 0.6 dB coding gain at a Binary Error Rate (BER) of 10−4 over the Additive White Gaussian Noise (AWGN) channel, and presents a significant reduction in the decoding complexity. Furthermore, we improved NRRWBF using the sum of the syndromes as a criterion to avoid the infinite loop. This will enable the decoder to attain a more efficient and effective decoding performance.

Wireless Communications and Mobile Computing•Jan 1, 2021•10 citations
An extrinsic reliability adjustment(ERA) scheme of low-density parity-check(LDPC) codes is proposed in this paper based on theoretical analysis of the physical significance for two previous weighted bit-flipping(WBF) algorithms, which have less complexity with poor error correcting performance. The novel scheme significantly improves the check-node realiability accuracy of the two previous WBF algorithms. Therefore, the flipping efficiency of the novel decoding algorithm is increased. The extensive simulations prove that the ERA scheme can obviously improves the performance of the two previous WBF algorithms and a great decoding gain is obtained over an AWGN channel, which achieves an appealing tradeoff between performance and 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.
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.
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 this contribution, a novel reliability-ratio based weighted bit-flipping (RRWBF) algorithm is proposed for decoding low density parity check (LDPC) codes. The RRWBF algorithm proposed is benchmarked against the conventional weighted bit-flipping (WBF) algorithm and the improved weighted bit-flipping (IWBF) algorithm. More than 1 and 2 dB coding gain was achieved at a BER of 10/sup -5/ while invoking the RRWBF algorithm in comparison to the two benchmarking schemes, when communicating over an AWGN and an uncorrelated Rayleigh channel, respectively. Furthermore, the decoding complexity of the proposed RRWBF algorithm is maintained at the same level as that of the conventional WBF algorithm.
In this study, we propose a “New Reliability Ratio Weighted Bit Flipping” (NRRWBF) algorithm for Low‐Density Parity‐Check (LDPC) codes. This algorithm improves the “Reliability Ratio Weighted Bit Flipping” (RRWBF) algorithm by modifying the reliability ratio. It surpasses the RRWBF in performance, reaching a 0.6 dB coding gain at a Binary Error Rate (BER) of 10−4 over the Additive White Gaussian Noise (AWGN) channel, and presents a significant reduction in the decoding complexity. Furthermore, we improved NRRWBF using the sum of the syndromes as a criterion to avoid the infinite loop. This will enable the decoder to attain a more efficient and effective decoding performance.