循环冗余校验串行抵消列表解码算法改进

Improvement of successive cancellation list decoding algorithm aided by cyclic redundancy check

采用动态列表长度及比特翻转,改进循环冗余校验串行抵消列表(CRC-SCL)解码算法,以降低其计算复杂度。与CRC-SCL解码算法采用的固定列表长度不同,改进算法通过动态增加列表长度来选择解码路径。同时,选取路径中似然比最小位进行比特翻转,修正解码序列,降低计算复杂度。在加性高斯白噪声信道下的仿真结果表明,随着Eb/No的增长,改进CRC-SCL算法计算复杂度降低越显著,当Eb/No为1.4dB时,平均计算复杂度可降低62.5%。

Dynamic list length and bit-flipping are used to improve the decoding algorithm of successive cancellation list aided by cyclic redundancy check (CRC-SCL) to reduce its computational complexity. Different from the fixed list length used in CRC-SCL decoding algorithm , the improved algorithm selects decoding path by dynamically increasing the list length. Moreover, The bits with the smallest likelihood ratio in the path are selected for bit- flipping to correct the decoded sequence and reduce the computational complexity. The results of simulation in additive Gaussian white noise channel show that, with the increase of Eb/No, the computational complexity of the improved CRC-SCL decoding algorithm decreases rapidly, and it can be reduced by 62.5% on average when Eb/No is 1.4 dB.