LDPC和积译码的一种改进算法

An enhanced algorithm based on sum-product decoding of LDPC

性能逼近Shannon限的低密度奇偶校验(LoW-Density Pa rity-Check,LDPC)纠错码,在实际应用中需要解决的问题是尽可能降低译码的复杂度.本文概要分析了低密度奇偶校验码的和积译码算法,并基于该算法,提出了一种新的LDPC的和积译码改进算法—差分译码算法,选择若干个绝对值最小的差分值进行运算.理论分析和仿真验证结果表明:本文提出的改进算法可进一步降低了译码复杂度,并使译码性能得到一定提高.

The Low Density Parity Check （LDPC） error correcting code needs to solve the problem of minimizing the complexity of decoding as far as possible in practical application, whose performance approaches to the Shannon delimitation. This paper is focused on researching in the sum-product decoding algorithm of LDPC （Low-Density Parity-Check, LDPC）, and a modified differential decoding algorithm is developed based on it, which selects the smallest absolute value of difference value to carry out operations. The theoretical analysis and simulation results show that the improved algorithm can further reduce the decoding complexity and the decoding performance would certainly be boosted to some extent.