An Improved Low Complex Hybrid Weighted Bit-Flipping Algorithm for LDPC Codes

In this paper, an improved low complex hybrid weighted bit-flipping algorithm is proposed for decoding low-density parity-check codes. Compared to the state-of-the art weighted bit-flipping algorithms (WBFs), the proposed algorithm improves both the coding gain and decoding speed with low computational complexity. Through simulations the proposed algorithm is shown to achieve coding gain improvement in the range of 0.14-1.5 dB at while reducing up to 22 % of the iterations required for decoding when compared with conventional WBF algorithms. Moreover, the proposed algorithm while maintaining less computational complexity is shown to achieve about 65 % faster decoding convergence without mitigating the decoding performance.