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

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

Yige Wang, Guilong Wu

Published Nov 17, 2017• 4 citations
Publisher

Abstract

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.

DOI
10.1049/iet-com.2017.0277

Related papers

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

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

Hua ZHOU, Rui Zhang, Qi‐Wei Ge +1 more

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).

•Apr 1, 2022•0 citations

Combined modified weighted bit-flipping decoding of low-density parity-check codes

Haiyi Huang, Yige Wang, Gang Wei

In this paper, we propose a combined modified weighted bit-flipping (CM-WBF) algorithm for low-density parity-check (LDPC) codes. The new algorithm combines modified weighted bit-flipping (M-WBF) with low complexity weighted bit-flipping (LC-WBF). Simulation results show that the new algorithm offers a better trade-off among performance, complexity, and convergence compared with M-WBF, LC-WBF and RR-WBF algorithms for finite geometry LDPC (FG-LDPC) codes.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2012•1 citation

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

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

Improved weighted bit-flipping algorithm for decoding LDPC Codes

Mengxiao Shan, Chunming Zhao, Ming Jiang

The paper presents an improvement of the weighted bit-flipping (WBF) decoding algorithm for LDPC codes proposed by Liu and Pados (2003). Simulation results show that the improved WBF algorithm provides about 0.25 dB coding gain over the Liu–Pados WBF algorithm. Also included in the paper is a simplified loop-detection algorithm, which is much easier to implement than the one proposed by Liu and Pados. The proposed WBF algorithm is particularly effective for decoding LDPC codes whose parity check matrices have large row/column weights such as finite geometry LDPC codes.

IEE Proceedings - Communications•Jan 1, 2005•36 citations
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 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.
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).
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
The paper presents an improvement of the weighted bit-flipping (WBF) decoding algorithm for LDPC codes proposed by Liu and Pados (2003). Simulation results show that the improved WBF algorithm provides about 0.25 dB coding gain over the Liu–Pados WBF algorithm. Also included in the paper is a simplified loop-detection algorithm, which is much easier to implement than the one proposed by Liu and Pados. The proposed WBF algorithm is particularly effective for decoding LDPC codes whose parity check matrices have large row/column weights such as finite geometry LDPC codes.