交叠的分层置信度传播LDPC译码算法  

Overlapped layered belief-propagation LDPC decoding algorithm

作　　者：范亚楠[1,2] 王丽冲 姚秀娟[1] 孟新[1] FAN Ya＇nan WANG Lichong YAO Xiujuan MENG Xin(National Space Science Center, CAS, Beijing 100190 China University of Chinese Academy of Sciences, Beijing 100190, China)

机构地区：[1]中国科学院国家空间科学中心,北京100190 [2]中国科学院大学,北京100190

出　　处：《西安电子科技大学学报》2017年第2期88-94,共7页Journal of Xidian University

基　　金：中国科学院创新基金资助项目(CXJJ14S126)

摘　　要：为进一步提升分层置信度传播译码算法的收敛速度和误码性能,提出了一种交叠的分层置信度传播译码算法.该算法将若干个子译码器以不同的校验节点更新顺序的同时进行计算,对于每个校验节点,在每次迭代更新后选取最可靠的信息参与下一次迭代,以此提高迭代的收敛速度与误码性能.仿真实验表明,在不增加额外存储空间的条件下,交叠的分层置信度传播译码算法相比于分层置信度传播算法有着更优的误码性能以及更快的收敛速度.另外,提出的交叠的分层置信度传播译码算法对于规则和不规则低密度奇偶校验码均有效.An Overlapped Layered-BP（OLBP） decoding algorithm is proposed aiming at further increasing the convergence speed and enhancing the error performance of the Layered Belief-Propagation （LBP） algorithm. In this algorithm, more than one sub-decoders are used to decode simultaneously, and sub- decoders have different check node updating orders from each other. The most reliable messages are kept and used for the next iteration for every check node, and thus a faster convergence can be provided. Simulation result shows that, compared with the LBP algorithm, the OLBP algorithm possesses a better error performance as well as a higher convergence speed and introducing no extra storage requirement. Moreover, the proposed algorithm is effective for both regular and irregular LDPC codes.

关 键 词：信道编码 低密度奇偶校验码 迭代译码 分层置信度传播 交叠的分层置信度传播 

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