标题： 极化码的Fast-SSC-Flip解码算法 显示英文标题

标题： Fast-SSC-Flip Decoding of Polar Codes

摘要： 极化码被认为是信道编码领域最近最令人兴奋的发现之一。对于短到中等长度的数据块，在列表解码下，其错误修正性能可以超过其他现代纠错码。然而，实现具有中等复杂度的高速列表解码器颇具挑战性。研究表明，与具有小列表大小的列表解码相比，逐次取消（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.