对LDPC码的LLR BP算法研究  

Research of LDPC decoding based on LLR BP algorithm

作　　者：朱晓瑜[1] 王中训[1] 张超[1] 王鹏翔[1] 尹爽爽[1] 

机构地区：[1]烟台大学光电科学与技术学院,山东烟台264001

出　　处：《电子设计工程》2012年第12期67-69,共3页Electronic Design Engineering

基　　金：山东省自然科学基金资助项目(ZR2009GM026)

摘　　要：在LDPC译码时,使用LLR BP算法其校验节点的计算复杂度十分高,而且当LDPC码中有许多的短环时,译码性能也会降低。基于以上的这些问题提出了一个新的混合校验变量过程,通过调整校验节点的处理振幅和变量节点的信息相关性来降低计算复杂度,其仿真过程表明在译码性能和运算复杂度上与LLR BP算法都有较大的提高。In iterations processing of LLR BP algorithm for LDPC decoding, the computational of check nodes renewal is high; The decoding performance will be reduced,while there are lots of loops in short LDPC codes.According to these problems,a new LLR BP decoding algorithm based on Hybrid Check-Variable offset processing is proposed in this paper.Decrease Complexity by adjusting amplitudes of check nodes processing and relativity of variable nodes by adjusting their information. Simulation results show that this improved decoding algorithm,compared with LLR BP algorithm,is consideration to decoding performance of LDPC and computational complexity.

关 键 词：LDPC码 TANNER图 Offset.BP.based算法 OFFSET BP算法 

分 类 号：TN911.22[电子电信—通信与信息系统]