一种可配置的LDPC码最小和译码算法

Configurable min-sum decoding algorithm for LDPC codes

在最小和译码算法(min-sum decoding algorithm,MS decoding)的基础上,提出了一种可配置的LDPC码最小和译码算法(configurable min-sum decoding algorithm,CMS decoding).在CMS译码算法的横向迭代过程中,用一个可配置的最佳修正因子与最小值的和来取代MS算法中所使用的次小值,从而省略了计算次小值的工作,大大降低了解码复杂度.仿真结果表明,在使用最佳因子的情况下,CMS算法能够达到非常接近MS算法的性能,具有较大的实用价值.用理论推导和蒙特卡洛仿真两种方法对不同信噪比下的最佳修正因子进行计算,两种方法得到的结果非常吻合.

Based on the min-sum decoding algorithm, a kind of iterative decoding algorithm for low-density parity-check （LDPC） codes, named configurable min sum decoding algorithm （CMS）, was proposed. During the horizontal step in the CMS decoding algorithm, it took a configurable optimal correction factor added the absolute minimum to replace the absolute sub-minimum so that it could omit the process of calculating the sub-minimum and simplify the complexity of decoding. Simulation results show that the CMS algorithm can achieve a performance very close to that of the MS algorithm with the optimal correction factors, making it a good candidate for practical systems. The optimal correction factors were obtained at different SNRs by Monte Carlo simulation and theoretical analysis, and the results were found to be in good agreement.