An Improved WBF Algorithm for Higher-Speed Decoding of LDPC Codes

TL;DR

This paper introduces a fast weighted bit flipping algorithm for LDPC codes that significantly improves decoding speed by reducing bit selection delay through a partially parallel strategy, validated by simulations.

Contribution

The paper proposes a novel partially parallel bit-choose strategy for weighted bit flipping, enhancing decoding speed of LDPC codes.

Findings

Decoding speed is greatly improved with the FWBF algorithm.

Simulation results verify the effectiveness of the proposed method.

Abstract

Due to the speed limitation of the conventional bit-chosen strategy in the existing weighted bit flipping algorithms, a high-speed LDPC decoder cannot be realized. To solve this problem, we propose a fast weighted bit flipping (FWBF) algorithm. Specifically, based on the stochastic error bitmap of the received vector, a partially parallel bit-choose strategy is adopted to lower the delay of choosing the bit flipped. Because of its partially parallel structure, the novel strategy can be well incorporated into the LDPC decoder [1]. The analysis of the decoding delay demonstrates that, the decoding speed can be greatly improved by adopting the proposed FWBF algorithm. Further, simulation results verify the validity of the proposed algorithm.