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

IET Communications

Modified channel‐independent weighted bit flipping decoding algorithm for low‐density‐parity‐check codes

Gaoyuan Zhang, Liang Zhou, Hong Wen

Published Apr 1, 2014• 3 citations
Publisher

Abstract

In this study, a modified channel‐independent weighted bit flipping (CIWBF) decoding algorithm is proposed for low‐density‐parity‐check codes. This modification, based on the ‘additive offset term adjustment’ in the reliability of the check sum, can also be applied to the reliability ratio weighted bit flipping algorithm. Simulation results show that the performance of the author's improved modified CIWBF algorithm is better than that of CIWBF algorithm about 0.45 dB at bit‐error rate of 10 −5 over an additive white Gaussian noise channel without much complexity increase.

DOI
10.1049/iet-com.2013.0753

Related papers

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

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

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

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

Mixed modified weighted bit‐flipping decoding of low‐density parity‐check codes

Haiyi Huang, Yige Wang, Gang Wei

In this study, a new weighted bit‐flipping (WBF) algorithm called mixed modified WBF (MM‐WBF) decoding is proposed for low‐density parity‐check codes. The new algorithm is built by mixing two WBF algorithms, one acting as the main decoding algorithm and the other acting as the auxiliary. Simulation results show that the new algorithm achieves a notable performance gain over reliability ratio‐based WBF, improved M‐WBF and low‐complexity WBF algorithms with almost the same computational complexity. Compared with some belief‐propagation‐based algorithms, MM‐WBF also provides an appealing performance against complexity trade‐off.

IET Communications•Dec 9, 2014•11 citations

Cyclic switching weighted bit‐flipping decoding for low‐density parity‐check codes

Yige Wang, Guilong Wu

A cyclic switching weighted bit‐flipping (CS‐WBF) decoding algorithm for low‐density parity‐check (LDPC) codes is proposed in this study. By carefully choosing two selection criteria of the bit to flip and cyclically switching from one criterion to the other according to some rules during decoding, the proposed scheme can effectively break decoding loops, which often appear for weighted bit‐flipping (WBF) algorithms and greatly degrade decoding performance. Simulation results show that CS‐WBF provides 0.7–1.3 dB coding gain over various simple improved WBF algorithms, such as reliability ratio‐based WBF and improved modified WBF, with almost the same complexity for both regular and irregular LDPC codes. Compared with WBF algorithms that break decoding loops and the belief propagation‐based algorithm, CS‐WBF can also provide a better complexity‐performance trade‐off.

IET Communications•Nov 17, 2017•4 citations
In this study, a modified channel‐independent weighted bit flipping (CIWBF) decoding algorithm is proposed for low‐density‐parity‐check codes. This modification, based on the ‘additive offset term adjustment’ in the reliability of the check sum, can also be applied to the reliability ratio weighted bit flipping algorithm. Simulation results show that the performance of the author's improved modified CIWBF algorithm is better than that of CIWBF algorithm about 0.45 dB at bit‐error rate of 10 −5 over an additive white Gaussian noise channel without much complexity increase.
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.
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.
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 study, a new weighted bit‐flipping (WBF) algorithm called mixed modified WBF (MM‐WBF) decoding is proposed for low‐density parity‐check codes. The new algorithm is built by mixing two WBF algorithms, one acting as the main decoding algorithm and the other acting as the auxiliary. Simulation results show that the new algorithm achieves a notable performance gain over reliability ratio‐based WBF, improved M‐WBF and low‐complexity WBF algorithms with almost the same computational complexity. Compared with some belief‐propagation‐based algorithms, MM‐WBF also provides an appealing performance against complexity trade‐off.
A cyclic switching weighted bit‐flipping (CS‐WBF) decoding algorithm for low‐density parity‐check (LDPC) codes is proposed in this study. By carefully choosing two selection criteria of the bit to flip and cyclically switching from one criterion to the other according to some rules during decoding, the proposed scheme can effectively break decoding loops, which often appear for weighted bit‐flipping (WBF) algorithms and greatly degrade decoding performance. Simulation results show that CS‐WBF provides 0.7–1.3 dB coding gain over various simple improved WBF algorithms, such as reliability ratio‐based WBF and improved modified WBF, with almost the same complexity for both regular and irregular LDPC codes. Compared with WBF algorithms that break decoding loops and the belief propagation‐based algorithm, CS‐WBF can also provide a better complexity‐performance trade‐off.