性能接近最优的LDPC码LLR-BP简化译码算法

Study on near optimum simplified belief propagation based decoding of low-density parity check codes

讨论了LDPC码的LLR-BP译码算法,对多项式拟合和偏移量近似两种简化算法进行了研究,通过仿真的方法确定了近似参数;算法仿真结果表明,这两种简化算法不仅易于硬件实现,而且性能接近最优。

In this paper,the log-likehood-ratio-based belief-propagation(LLR-BP) decoding algorithm and its two simplified versions which utilize offset term and polyfit for low-density parity check codes are discussed.The key parameters of the two simplified algorithms are obtained by simulation.The simulation results show that both simplified decoding algorithms not only may be efficiently implemented in hardware but also achieve a performance of very close to that of the BP algorithm.