关键词: 低复杂度, 多阈值比特翻转, 校验和更新, 硬判决译码, 低密度奇偶校验码

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