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

Two-stage WBF Algorithm for LDPC Codes based on Multi-/single-bit Switching Mechanism

Hua ZHOU, Rui Zhang, Qi‐Wei Ge, Chuan-sheng SHI

Published Apr 1, 2022• 0 citations
Publisher

Abstract

To improve the decoding speed and performance of Weighted Bit Flipping (WBF) decoding algorithm for Low Density Parity Check (LDPC) codes, a two-stage WBF algorithm with a multi-/single-bit switching mechanism is proposed. It first performs multi-bit flipping decoding in the first-stage decoder. When cyclic flipping is detected or the maximum flipping function value is less than zero, it switches to the second-stage decoder. Simulation results show that the proposed algorithm obtains gains both in average decoding iteration number and in decoding performance compared with the Sum of the Magnitude based WBF (SMWBF) and the Variable node updating based SMWBF (VSMWBF).

DOI
10.13756/j.gtxyj.2022.02.003

Related papers

A new hybrid decoding algorithm for LDPC codes based on the improved variable multi weighted bit-flipping and BP algorithms

Ehsan Olyaei Torshizi, Hossein Sharifi, Meysam Seyrafi

In this paper, a new two-stage hybrid algorithm for decoding Low-Density Parity-Check (LDPC) codes is proposed that incorporates two iterative decoding. For the first stage of decoding, we offer a new decoding algorithm called Improved Variable Multi Weighted Bit-Flipping (IVMWBF) algorithm. Since the IVMWBF algorithm is based on the idea of flipping variable multi bits in each iteration, both improvement in performance and reduction in iteration number and computational complexity are observed in this algorithm. The proposed hybrid algorithm which is a combination of the IVMWBF and BP algorithms, while having a performance exactly similar to that of the BP algorithm, has less complexity compared to that algorithm.

Iranian Conference on Electrical Engineering•May 1, 2013•10 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

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

Two-staged Weighted Bit Flipping (WBF) decoding algorithm for LDPC codes

Kexiang Ma, Jing Jin, Wei Li +1 more

In this paper, a two-staged decoding strategy which can be used for the Weighted Bit Flipping (WBF) based decoding algorithm for LDPC codes is presented. At the two stages, a parallel WBF and bit-flipping (BF) algorithms are adopted separately. Correspondingly, by the study of the iterative decoding process of the PWBF algorithm, a simple function is introduced to dynamically implement the switch of two decoding stages. The proposed algorithm can noticeably lower the error floor of PWBF algorithm with a modest increase in computation complexity and hardware cost. The validation of the proposed algorithm is verified by simulation.

IEEE International Conference on Anti-counterfeiting, Security, and Identification (ASID)•Sep 1, 2015•4 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

Low-complexity decoding of LDPC codes using reduced-set WBF-based algorithms

Sadjad Haddadi, Mahmoud Farhang, Mostafa Derakhtian

Abstract We propose a method to substantially reduce the computational complexity of iterative decoders of low-density parity-check (LDPC) codes which are based on the weighted bit-flipping (WBF) algorithm. In this method, the WBF-based decoders are modified so that the flipping function is calculated only over a reduced set of variable nodes. An explicit expression for the achieved complexity gain is provided and it is shown that for a code of block length N, the decoding complexity is reduced from O(N2) to O(N). Moreover, we derive an upper bound for the difference in the frame error rate of the reduced-set decoders and the original WBF-based decoders, and it is shown that the error performances of the two decoders are essentially the same.

EURASIP Journal on Wireless Communications and Networking•Sep 21, 2020•7 citations
To improve the decoding speed and performance of Weighted Bit Flipping (WBF) decoding algorithm for Low Density Parity Check (LDPC) codes, a two-stage WBF algorithm with a multi-/single-bit switching mechanism is proposed. It first performs multi-bit flipping decoding in the first-stage decoder. When cyclic flipping is detected or the maximum flipping function value is less than zero, it switches to the second-stage decoder. Simulation results show that the proposed algorithm obtains gains both in average decoding iteration number and in decoding performance compared with the Sum of the Magnitude based WBF (SMWBF) and the Variable node updating based SMWBF (VSMWBF).
In this paper, a new two-stage hybrid algorithm for decoding Low-Density Parity-Check (LDPC) codes is proposed that incorporates two iterative decoding. For the first stage of decoding, we offer a new decoding algorithm called Improved Variable Multi Weighted Bit-Flipping (IVMWBF) algorithm. Since the IVMWBF algorithm is based on the idea of flipping variable multi bits in each iteration, both improvement in performance and reduction in iteration number and computational complexity are observed in this algorithm. The proposed hybrid algorithm which is a combination of the IVMWBF and BP algorithms, while having a performance exactly similar to that of the BP algorithm, has less complexity compared to that algorithm.
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.
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.
In this paper, a two-staged decoding strategy which can be used for the Weighted Bit Flipping (WBF) based decoding algorithm for LDPC codes is presented. At the two stages, a parallel WBF and bit-flipping (BF) algorithms are adopted separately. Correspondingly, by the study of the iterative decoding process of the PWBF algorithm, a simple function is introduced to dynamically implement the switch of two decoding stages. The proposed algorithm can noticeably lower the error floor of PWBF algorithm with a modest increase in computation complexity and hardware cost. The validation of the proposed algorithm is verified by simulation.
Abstract We propose a method to substantially reduce the computational complexity of iterative decoders of low-density parity-check (LDPC) codes which are based on the weighted bit-flipping (WBF) algorithm. In this method, the WBF-based decoders are modified so that the flipping function is calculated only over a reduced set of variable nodes. An explicit expression for the achieved complexity gain is provided and it is shown that for a code of block length N, the decoding complexity is reduced from O(N2) to O(N). Moreover, we derive an upper bound for the difference in the frame error rate of the reduced-set decoders and the original WBF-based decoders, and it is shown that the error performances of the two decoders are essentially the same.