一种交叠的Shuffled-BP LDPC译码算法

发布时间：2018-01-28 10:10

本文关键词： LDPC码收敛速度译码算法 Shuffled-BP 交叠的Shuffled-BP　出处：《电子与信息学报》2016年11期 　论文类型：期刊论文

【摘要】：Shuffled-BP(SBP)译码算法是一种基于变量节点的串行消息传递译码算法,其收敛速度快于原有的置信度传播译码算法,然而由于实际工程实现中的半并行化处理,其收敛速度和误码性能均有所降低。为了进一步提高SBP算法的性能,该文提出一种交叠的Shuffled-BP(Overlapped Shuffled-BP,OSBP)译码算法。该算法采用若干个相同的子译码器以不同的更新顺序同时进行更新,对于每个变量节点,在每次迭代更新后选取最可靠的信息参与下一次迭代,以此提高迭代的收敛速度。理论分析和仿真实验均表明,在不增加额外存储空间的条件下,OSBP算法相比于SBP算法有着更优的误码性能以及更快的收敛速度。此外,提出的OSBP算法对于规则和不规则LDPC码均有效。
[Abstract]:Shuffled-BPNSBP) decoding algorithm is a serial message transfer decoding algorithm based on variable nodes, which converges faster than the original confidence propagation decoding algorithm. However, due to the semi-parallelization in practical engineering, the convergence speed and error performance of the algorithm are reduced. In order to further improve the performance of the SBP algorithm. In this paper, an overlapping Shuffled-BP(Overlapped Shuffled-BP is proposed. OSBP) decoding algorithm which uses several same sub-decoders to update simultaneously in different updating order for each variable node. After each iteration update, the most reliable information is selected to participate in the next iteration, so as to improve the convergence rate of the iteration. Theoretical analysis and simulation experiments show that, without additional storage space. Compared with SBP algorithm, OSBP algorithm has better error performance and faster convergence speed. In addition, the proposed OSBP algorithm is effective for both regular and irregular LDPC codes.
【作者单位】：中国科学院国家空间科学中心;中国科学院大学;
【基金】：中国科学院创新基金(CXJJ14S126)~~
【分类号】：TN911.22
【正文快照】： 2(中国科学院大学北京100190)1引言LDPC码以其渐进香农限[1,2]的误码性能而被信道编码界所广泛关注。由于其校验矩阵的稀疏性,其译码算法的空间复杂度较低,并且相比于Turbo码有着更低的错误平台。1962年,Gallager在其博士论文[3]里提出了置信度传播(Belief-Propagation,BP)LDP

【相似文献】