LDPC Decoding Scheduling for Faster Convergence and Lower Error Floor
LDPC Decoding Scheduling for Faster Convergence and Lower Error Floor
复制标题
DOI：
10.1109/tcomm.2014.2349943
复制
发表时间：
2014-08
影响因子：
8.3
通讯作者：
Huang-Chang Lee;Yeong-Luh Ueng
中科院分区：
文献类型：
--
作者：
Huang-Chang Lee;Yeong-Luh Ueng
本文提出了一种基于最大互信息增量（M2I2）的算法，该算法可用于安排低密度奇偶校验（LDPC）解码时间表以加快收敛速度，其中增量用于指导固定解码时间表的安排。要更新的消息的预测互信息用于增加的计算。通过展望几个解码阶段，可以实现高阶预测，然后可以使用高阶预测来设计具有更快收敛的调度。对于一个单一的接收帧，不同的解码结果可以使用不同的时间表，因此，调度分集，降低了错误平层从占主导地位的陷阱集，提出。通过采用基于M2I2的调度以及调度分集，可以提高瀑布区域中的收敛速度和地板区域中的错误率。
This paper presents a maximum mutual information increase (M2I2)-based algorithm that can be used to arrange low-density parity-check (LDPC) decoding schedules for faster convergence, where the increase is used to guide the arrangement of the fixed decoding schedule. The predicted mutual information for the messages to be updated is used in the calculation of the increase. By looking ahead for several decoding stages, a high-order prediction can be realized, which can then be used to devise a schedule with an even faster convergence. For a single received frame, different decoding results can be obtained using different schedules, and, hence, schedule diversity, that lowers the error floor resultant from the dominant trapping sets, is proposed. By adopting the M2I2-based schedule together with the schedule diversity, both the convergence speed in the waterfall region and the error-rate in the floor region can be improved.