瑞利信道下基于广义阈值函数的LDPC译码算法

摘要

There exist two criterions for the existing LDPC decoding algorithms at node-processing,majority-logic processing and fully processing.The algorithms can't make flexible tradeoffs between performance and complexity,since their threshold parameters are usually set to be unvaried.This paper first presents a generalized threshold-function,which can apply to most of the existing binary LDPC decoding algorithms to control the participating-nodes in the iterations by adjusting the threshold parameters.Then a new non-uniform quantization decoding algorithm combined with syndrome and constellation mapping information is presented,which can further reduce the complexity and memory load.Simulation results show that the presented algorithm can obtain excellent decoding performances with very low quantization level over the Rayleigh fading channel.Furthermore,it is shown that only 30％ variable nodes are involved in the iterations when combined with the presented threshold-function,which can remarkably reduce the complexity.%现存的LDPC译码算法,其节点处理依据主要遵循大数逻辑准则和完全处理准则,对应的阈值参数一般是固定不变的,在性能和复杂度之间的均衡不够灵活.本文首先提出一种广义阈值函数,能应用于大多数基于可靠度的二元LDPC译码算法.通过调整阈值参数,可方便地控制参与迭代处理的节点队列.其次,本文提出一种基于伴随式和星座映射信息的非均匀量化译码算法,可进一步降低复杂度和存储负荷.实验结果显示,在瑞利信道下,本文算法能够在较低的量化比特下获得优良的译码性能;结合广义阈值函数,只有约30％的变量节点参与迭代运算,译码复杂度可显著降低.