低密度パリティ検査(LDPC)符号の Modified Weighted Bit Flipping 復号アルゴリズム

稲葉洋一, 大槻知明

洋一 稲葉, 知明 大槻

健次 喜多, 哲夫 辻岡

Yoichi Inaba

Recently, various decoding algorithms with Low Density Parity Check (LDPC) codes have been proposed. Most algorithms can be divided into a hard decision algorithm and a soft decision algorithm. The Weighted Bit Flipping (WBF) algorithm that is between a hard decision and a soft decision algorithms has been proposed. The Bootstrapped WBF and Modified WBF algorithms have been proposed to improve the error rate performance and decoding complexity of the WBF algorithm. In this letter, we apply the Bootstrap step to the Modified WBF algorithm. We show that the Bootstrapped modified WBF algorithm outperforms the WBF, Bootstrapped WBF, and Modified WBF algorithms. Moreover, we show that the Bootstrapped modified WBF algorithm has the lowest decoding complexity.

Ming Yan Jiang, Chunming Zhao, Zhihua Shi +1 more

We present a major improvement to the modified weighted bit flipping (MWBF) decoding algorithm for low density parity-check (LDPC) codes. We improve the flipping criterion by introducing a more efficient method for computing the reliability of the parity checks. We derive an approximate theoretical expression for the weighting factor and demonstrate its consistency with simulation results. The improved MWBF algorithm achieves a noticeable gain over the MWBF algorithm with only a modest increase in computational complexity.

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.