一种基于互信息最大化的Raptor码优化设计方法  

An Optimal Design Method of Raptor Code Based on Mutual Information Maximization

作　　者：杨玮[1] 赵彦晓[1] 姚博旭 YANG Wei;ZHAO Yan-xiao;YAO Bo-xu(School of Information and Communication Engineering,Beijing Information Science and Technology University,Beijing 100101,China)

机构地区：[1]北京信息科技大学信息与通信工程学院,北京100101

出　　处：《科学技术与工程》2020年第19期7724-7728,共5页Science Technology and Engineering

基　　金：北京市组织部优秀人才骨干项目(2014000020124G102);北京信息科技大学师资补充与支持计划(2019—2021)(5111911147);北京信息科技大学促进高校内涵发展科研水平提高项目(5211910924)。

摘　　要：Raptor码通过级联预编码可以很好地改善错误平层问题,但编译码的复杂度相对较高。为了降低级联Raptor码的复杂度,提出一种基于互信息最大化的Raptor码优化设计方法。该方法基于外部信息转移图的渐进收敛分析,从最大化互信息的角度出发,得到有限迭代次数约束下的校验节点度分布的数学模型。仿真结果表明,当译码迭代次数一定时,基于互信息最大化设计的Raptor码与码率最大化设计的Raptor码相比,具有更好的误码性能。Raptor code can improve the problem of error leveling by cascading precoding, but the complexity of coding is relatively high. In order to reduce the complexity of concatenated Raptor codes, an optimal design method based on mutual information maximization was proposed. This method was based on the gradual convergence analysis of the external information transfer graph. From the perspective of maximizing mutual information, the mathematical model of the degree distribution of check nodes under the constraint of the limited number of iterations is obtained. The simulation results show that when the number of decoding iterations is fixed, the designed Raptor code based on mutual information maximization has better bit error rate performance than the designed Raptor code based on rate maximization.

关 键 词：RAPTOR码 外部信息转移图 互信息最大化 度分布设计 迭代次数约束 

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