In the successive cancellation list decoding of polar codes, the metric sorting dominates the overall decoding latency. To reduce the latency of metric sorting, this paper proposes a new sorting method, called interleaved local sorting, which divides the metrics to be sorted into several groups and locally sorts each group independently. In addition, an interleaving scheme is proposed to recover the performance degradation caused by the local sorting. A hardware architecture effective in reducing the overall latency as well as the hardware complexity is also proposed based on the proposed metric sorting. The evaluation results show that the proposed interleaved local sorting architecture outperforms the state-of-the-art metric sorting architectures in terms of latency and hardware complexity when the list size is not small.

中文翻译：

---

用于 Polar 码的连续取消列表解码的交错本地排序


在极性码的连续消除列表解码中，度量排序在整体解码延迟中占主导地位。为了减少度量排序的延迟，本文提出了一种新的排序方法，称为交错本地排序，它将要排序的度量分为几组，并对每个组进行独立的本地排序。此外，还提出了一种交织方案来恢复由本地排序引起的性能下降。基于所提出的度量排序，还提出了一种有效减少总体延迟和硬件复杂性的硬件架构。评估结果表明，当列表大小不小时，所提出的交错局部排序架构在延迟和硬件复杂性方面优于最先进的度量排序架构。