论文部分内容阅读
适用于极化码置信传播(Belief-Propagation,BP)算法的早期终止准则研究具有实际意义。本文提出将循环冗余校验(Cyclic Redundancy Check,CRC)作为极化码BP算法的早期终止准则(简称为BP-CRC),当BP算法迭代次数大于门限后,如果信源估计值符合CRC校验,提前终止迭代;否则,就按固定迭代次数执行完BP算法。(1024,512)极化码通过二进制输入高斯白噪声信道后,提出的BP-CRC与基于生成矩阵G的早期终止准则(简称为BP-Gmatrix)做对比。仿真结果表明:在译码性能上,BP-CRC与原始BP算法基本一致;在平均迭代次数减少的效果上,和BP-Gmatrix一致;随着信噪比的增大,两者平均迭代次数减少的次数更明显。CRC比生成矩阵G检测的计算复杂度更低。平均迭代次数的减低,可以有效降低BP译码器的时延和能耗。因此,CRC是有效的低能耗和低复杂度的极化码BP算法早期终止准则。
It is of practical significance to study the early termination criterion for the Belief-Propagation (BP) algorithm. In this paper, Cyclic Redundancy Check (CRC) is proposed as the early termination criterion (abbreviated as BP-CRC) of the BP algorithm of the polarization code. If the number of iterations of the BP algorithm is greater than the threshold, if the source estimate conforms to the CRC Test, terminate the iteration ahead of time; otherwise, execute the BP algorithm according to the fixed number of iterations. (1024,512) Polarimetric code After binary input Gaussian white noise channel, the proposed BP-CRC is compared with the early termination criterion based on generator matrix G (BP-Gmatrix for short). The simulation results show that BP-CRC is basically consistent with the original BP algorithm in decoding performance, consistent with BP-Gmatrix in reducing the average number of iterations, and decreasing the average number of iterations as the SNR increases The number of more obvious. The computational complexity of CRC is lower than that of generating matrix G. The average number of iterations to reduce, can effectively reduce the BP decoder delay and energy consumption. Therefore, CRC is an effective early termination criterion for BP algorithm with low power consumption and low complexity.