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

EURASIP Journal on Wireless Communications and Networking

Mahmoud Farhang¹  Sadjad Haddadi¹  Mostafa Derakhtian¹ 

[1] Department of Electrical and Computer Engineering, Shiraz University, Shiraz, Iran;

关键词: Low-density parity-check (LDPC) codes;    Iterative decoding;    Weighted bit-flipping (WBF);   

DOI  :  10.1186/s13638-020-01791-5

来源: Springer

【 摘 要 】

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.

【 授权许可】

CC BY