Partitioned Successive-Cancellation Flip Decoding of Polar Codes
Partitioned Successive-Cancellation Flip Decoding of Polar Codes
复制标题
DOI：
10.1109/icc.2018.8422464
复制
发表时间：
2017-11
期刊：
影响因子：
--
通讯作者：
Furkan Ercan;C. Condo;Seyyed Ali Hashemi;W. Gross
中科院分区：
文献类型：
--
作者：
Furkan Ercan;C. Condo;Seyyed Ali Hashemi;W. Gross
极化码是已经被选择用于下一代无线通信标准的一类信道容量实现码。连续抵消（SC）是第一个提出的解码算法，遭受中等的纠错性能在中等码长。为了提高SC的纠错性能，有两种方法可用：（i）SC-列表解码，其通过并行运行多个SC解码器来保持候选列表，从而增加实现复杂度，以及（ii）SC-翻转解码，其依赖于单个SC模块，并且保持计算复杂度接近SC。在这项工作中，我们提出了分区SC翻转（PSCF）译码算法，该算法在纠错性能和平均计算复杂度方面优于SC翻转，从而导致更高的吞吐量和降低的每个码字的能量消耗。我们还介绍了一个分区方案，最适合我们的PSCF解码器。仿真结果表明，在相同的误帧率下，PSCF的计算复杂度比SC-Flip解码器低4.1倍。在相同的平均迭代次数下，PSCF的纠错性能在误帧率为10^-3时比SC-Flip高出0.26 dB。
Polar codes are a class of channel capacity achieving codes that has been selected for the next generation of wireless communication standards. Successive-cancellation (SC) is the first proposed decoding algorithm, suffering from mediocre error-correction performance at moderate code lengths. In order to improve the error-correction performance of SC, two approaches are available: (i) SC-List decoding which keeps a list of candidates by running a number of SC decoders in parallel, thus increasing the implementation complexity, and (ii) SC-Flip decoding that relies on a single SC module, and keeps the computational complexity close to SC. In this work, we propose the partitioned SC-Flip (PSCF) decoding algorithm, which outperforms SC-Flip in terms of error-correction performance and average computational complexity, leading to higher throughput and reduced energy consumption per codeword. We also introduce a partitioning scheme that best suits our PSCF decoder. Simulation results show that at equivalent frame error rate, PSCF has up to 4.1x less computational complexity than the SC-Flip decoder. At equivalent average number of iterations, the error-correction performance of PSCF outperforms SC-Flip by up to 0.26 dB at frame error rate of 10^-3.