Fast-SSC-flip decoding of polar codes
Fast-SSC-flip decoding of polar codes
复制标题
DOI：
10.1109/wcncw.2018.8369026
复制
发表时间：
2017-12
期刊：
影响因子：
--
通讯作者：
P. Giard;A. Burg
中科院分区：
文献类型：
--
作者：
P. Giard;A. Burg
极化码被广泛认为是信道编码中最令人兴奋的最新发现之一。对于短到中等块长度，它们在列表解码下的纠错性能可以优于其他现代纠错码。然而，具有中等复杂度的高速基于列表的解码器的实现具有挑战性。连续消除（SC）翻转解码被证明是能够竞争的纠错性能相比，具有小的列表大小的列表解码，在复杂度的一小部分，但遭受从一个可变的执行时间和更高的最坏情况下的延迟。在这项工作中，我们将展示如何修改国家的最先进的高速SC解码算法，将SC翻转的想法。算法的改进，以及针对硬件实现的平均执行时间的结果。实验结果表明，本文提出的快速SSC翻转算法在保持纠错性能的同时，译码速度比已有算法提高了近一个数量级。
Polar codes are widely considered as one of the most exciting recent discoveries in channel coding. For short to moderate block lengths, their error-correction performance under list decoding can outperform that of other modern error-correcting codes. However, high-speed list-based decoders with moderate complexity are challenging to implement. Successive-cancellation (SC)-flip decoding was shown to be capable of a competitive error-correction performance compared to that of list decoding with a small list size, at a fraction of the complexity, but suffers from a variable execution time and a higher worst-case latency. In this work, we show how to modify the state-of-the-art high-speed SC decoding algorithm to incorporate the SC-flip ideas. The algorithmic improvements are presented as well as average execution-time results tailored to a hardware implementation. The results show that the proposed fast-SSC-flip algorithm has a decoding speed close to an order of magnitude better than the previous works while retaining a comparable error-correction performance.