一种低复杂度的多元LDPC译码算法

发布时间：2018-03-05 23:20

本文选题：多元LDPC码　切入点：译码算法　出处：《电讯技术》2017年03期 　论文类型：期刊论文

【摘要】：针对多元低密度奇偶校验(LDPC)码译码复杂度高、时延大等问题,提出了一种基于硬信息的低复杂度多元LDPC译码算法。来自信道的接收信号在初始化时,先进行非均匀量化预处理。在迭代过程中,校验节点端只需传输单个比特的二进制硬可靠度信息至变量节点。在变量节点端,可靠度信息按比特位进行简单的累加和更新,无需任何的系数修正操作。同时,变量节点使用了全信息的方式将信息传输至与其相邻的校验节点。仿真结果显示,与基于比特可靠度(BRB)的多元LDPC译码算法相比,提出的算法在较低量化比特情况下,能获得约0.3 d B的译码性能增益,且译码复杂度更低。
[Abstract]:A low complexity multivariate LDPC decoding algorithm based on hard information is proposed to solve the problems of high decoding complexity and long delay of multivariate low density parity check (LDPC) codes. When the received signals from the channel are initialized, a low complexity multivariate LDPC decoding algorithm based on hard information is proposed. In the iterative process, the verification node only needs to transmit the binary hard reliability information of a single bit to the variable node. At the variable node end, the reliability information is simply accumulated and updated by bits. There is no need for any coefficient correction operation. At the same time, the variable nodes transmit the information to the adjacent check nodes using full information. The simulation results show that, compared with the multivariate LDPC decoding algorithm based on bit reliability, In the case of low quantization bits, the proposed algorithm can gain a decoding performance gain of about 0.3 dB, and the decoding complexity is lower.
【作者单位】：广西大学计算机与电子信息学院;广西高校多媒体通信与信息处理重点实验室;广西多媒体通信与网络技术重点实验室培育基地;
【基金】：国家自然科学基金资助项目(61261023,61362010,61661005) 广西自然科学基金资助项目(2014GXNSFBA118276)
【分类号】：TN911.22

【参考文献】