低密度奇偶校验码中不同译码算法之间的对比  

Compare the Difference of Different LDPC Decoding Algorithms

作　　者：李慧 柳铮 易卫明 LI Hui;LIU Zheng;YI Wei-ming(Troop 75775,Kunming 650000,China;Fourth Research institute of Telecommunications Technology Co.,Ltd.,Xi'an 710061,China)

机构地区：[1]75775部队,昆明650000 [2]电信科学技术第四研究所有限公司,西安710061

出　　处：《无线通信技术》2022年第3期16-19,23,共5页Wireless Communication Technology

摘　　要：前向纠错码中的LDPC码给出了非常逼近香农限的结果。当算法复杂度和时延没有限制的时候这种结果可以实现。我们对log域SPA算法和概率域SPA算法进行了比较,通过比较得到在码率相同的情况下,码长的增长会改善算法的性能。概率域SPA算法在性能上优于log域SPA算法,而log域SPA算法的实现复杂度要低于概率域SPA算法。LDPC codes in forward error correction codes give results that are very close to the Shannon limit. This result can be achieved when there are no constraints on algorithmic complexity and latency. We compared the Log-domain SPA algorithm with the Prob-domain SPA algorithm, and found that under the same code rate, the increase of the code length will improve the performance of the algorithm.The performance of the Prob domain SPA algorithm is better than the Log domain SPA algorithm, and the implementation complexity of the Log domain SPA algorithm is lower than that of the Prob domain SPA algorithm.

关 键 词：低密度奇偶校验码 和积算法 log域 概率域 

分 类 号：TN92[电子电信—通信与信息系统]