论文标题
SC-LDPC代码的有限长度缩放量表有限数量的解码迭代
Finite-Length Scaling of SC-LDPC Codes With a Limited Number of Decoding Iterations
论文作者
论文摘要
我们提出了四个有限长度缩放定律，以预测在完全信念传播（BP）解码下的空间耦合低密度平等检查代码的帧误率（FER）性能，并限制了解码迭代的数量和用于滑动窗口解码的缩放定律，同样有限。全BP解码的法律提供了准确性和计算复杂性之间的选择；它们之间的平衡是通过通过时间集成的Ornstein-Uhlenbeck过程来建模一定数量的BP迭代后的解码位数量的法律来实现的。该框架进一步开发为模型滑动窗口解码，作为集成的Ornstein-uhlenbeck过程与吸收屏障之间的竞赛，该障碍物对应于滑动窗口的左边界。提出的缩放定律得出准确的预测。
We propose four finite-length scaling laws to predict the frame error rate (FER) performance of spatially-coupled low-density parity-check codes under full belief propagation (BP) decoding with a limit on the number of decoding iterations and a scaling law for sliding window decoding, also with limited iterations. The laws for full BP decoding provide a choice between accuracy and computational complexity; a good balance between them is achieved by the law that models the number of decoded bits after a certain number of BP iterations by a time-integrated Ornstein-Uhlenbeck process. This framework is developed further to model sliding window decoding as a race between the integrated Ornstein-Uhlenbeck process and an absorbing barrier that corresponds to the left boundary of the sliding window. The proposed scaling laws yield accurate FER predictions.
