基于校验和更新的低复杂度LDPC码硬判决译码算法

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

为使低密度奇偶校验(low-density parity-check,LDPC)码的硬判决译码算法具有更低的计算复杂度和更高的译码性能,提出了一种新的校验和计算算法,具有较低的计算量,可应用于现有的所有硬判决译码算法.结合该算法对一种计算量近似于比特翻转(bit flipping,BF)算法的多阈值比特翻转(multi-thresholdBF,MTBF)算法进行了进一步改进,获得了更低的译码复杂度和更好的译码性能,在迭代5次时获得了0.15 dB的性能增益.

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 hard- decision 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.