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

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.