简化的极化码译码算法

Simplified polar code decoding algorithm

极化码是目前唯一可以从数学角度证明达到香农极限的纠错编码技术。但是传统的译码算法、连续删除(SC)译码和连续删除列表(SCL)译码算法复杂度较高,使得译码过程有较大译码延时。经过研究译码算法的原理和特点,证明部分节点的译码运算是冗余,提出了SC译码和SCL译码简化算法。证明了简化的译码算法在保证译码性能不变的前提下,显著降低了译码的复杂度。

Polar code is an error correction coding technique, which can prove from the mathematical point of view to reach Shan-non ′ s limit. However, the traditional decoding algorithm, such as the successive cancellation（ SC） and the successive cancellation list（ SCL） decoding algorithms, have high complexity and latency in the decoding ends. This paper studies the principle and structure of the decoding algorithm, which proves that the decoding operation of some nodes is redundant. Therefore, simplified SC decoding and SCL decoding algorithm is proposed. It is proved that the simplified decoding algorithm can reduce the complexity of the de-coding algorithm and maintain the original error rate performance at the same time.