分段CRC辅助极化码SCL比特翻转译码算法

Segmented CRC-aided SCL bit-flip decoding algorithm for polar codes

极化码是一种被严格证明到达信道容量的信道编码方法。虽然串行抵消列表比特翻转(SCLF)译码算法可提高译码性能,但导致较高的译码复杂度。为降低译码复杂度,提出一种分段CRC辅助串行抵消列表比特翻转极化码译码算法。该算法在码字构造过程中,通过添加分段CRC校验,可提前终止翻转译码过程。在中短码长下,可显著降低极化码比特翻转译码复杂度。仿真结果表明,当L=8,Eb N0=1.5 dB时,与SCLF方法翻转2 bit译码算法相比,提出方法的译码复杂度可降低71.9%,同时获得较好的性能增益。

Polar code is a channel coding scheme that has been strictly proved to be able to achieve the channel capacity.Although the successive cancellation list bit-flip(SCLF)decoding algorithm can improve the decoding performance,it leads to higher decoding complexity.Therefore,a low-complexity segmented CRC-aided SCL bit-flip(SCA-SCLF)decoding of polar codes is proposed to reduce the decoding complexity.The decoding process can be terminated early with segmented CRC(cyclic redundancy check),which can reduce the bit-flip decoding complexity significantly for polar codes with short and medium block lengths.The simulation results show that when L=8 and Eb N0=1.5 dB,the decoding complexity of the proposed scheme can be reduced by 71.9%in comparison with the 2 bit-flip decoding algorithm using SCLF for polar code(512,256+24).Meanwhile,the proposed scheme can get better performance gain.