Low-complexity decoding of LDPC codes using reduced-set WBF-based algorithms

Abstract

We propose a method to substantially reduce the computational complexity of iterative decoders of low-density parity-check (LDPC) codes which are based on the weighted bit-flipping (WBF) algorithm. In this method, the WBF-based decoders are modified so that the flipping function is calculated only over a reduced set of variable nodes. An explicit expression for the achieved complexity gain is provided and it is shown that for a code of block length N, the decoding complexity is reduced from O(N2) to O(N). Moreover, we derive an upper bound for the difference in the frame error rate of the reduced-set decoders and the original WBF-based decoders, and it is shown that the error performances of the two decoders are essentially the same.

International Journal of Electronics and Telecommunications

“…Although its performance is slightly poor, the BF algorithm only involves logical operations; thus, it is simple, fast, and easy to implement. To improve the performance of the BF algorithm, a weighted BF (WBF) algorithm [8] and various improved algorithms [9] have been developed. However, decoding complexity is considerably increased.…”