Journal of Shanghai University(Natural Science Edition) ›› 2017, Vol. 23 ›› Issue (4): 510-516.doi: 10.12066/j.issn.1007-2861.1674

Previous Articles     Next Articles

Hard-decision decoding algorithm with low complexity based on check-sum updating for LDPC codes

WU Yimeng, SHI Zhidong, DENG Bin   

  1. School of Communication and Information Engineering, Shanghai University, Shanghai 200444, China
  • Received:2015-09-28 Online:2017-08-30 Published:2017-08-30

Abstract:

To reduce computational complexity of hard-decision decoding algorithms of low-density parity-check (LDPC) codes and improve decoding performance, a check-sums algorithm is proposed. It requires less computation, and is applicable to all existing harddecision algorithms. The algorithm is applied to a multi-threshold bit flipping (MTBF) algorithm whose computation complexity is similar to the bit flipping (BF) algorithm, and further improvement is made. The results show that the proposed algorithm can achieve a 0.15 dB performance gain after 5 iterations with lower computational complexity and better decoding performance.

Key words: check-sums updating, hard-decision decoding, multi-threshold bit flipping (MTBF), low complexity, low-density parity-check (LDPC) codes