LDPC码差分译码算法

Difference-based decoding algorithm for LDPC codes

对于LDPC码的译码算法——和积算法,提出了一种新的LDPC规则码的差分译码算法,其主要思想是,把概率信息的差分值作为LDPC码Tanner图上的传送信息,而对于校验节点和消息节点的更新都是在特定的加法域中进行。对整个过程从数学上做了推导论证。将差分算法与LLRBP算法做了比较。与传统的基于对数似然比的译码方法相比,新算法的计算复杂度有明显降低,而译码性能则损失不大。

As for the sum-product decoding algorithm of low density parity check （LDPC）codes, A difference-based decoding method is proposed. The main idea is shown as follows. The message transmitted on the Tanner graph of LDPC are based on the probability differences, and the updates of both check nodes and message nodes are carried out on some special addition domain. The whole decoding method is proved mathematically. Compared with the traditional LLR-based decoding method, it is found that the proposed method has much lower complexity and it has no obvious loss of performance and convergence.