Due to the low-latency and high-reliability requirements of 5G, low-complexity node-based successive cancellation list (SCL) decoding has received considerable attention for use in 5G communications systems. By identifying special constituent codes in the decoding tree and immediately decoding these, node-based SCL decoding provides a significant reduction in decoding latency compared to conventional SCL decoding. However, while there exists many types of nodes, the current node-based SCL decoders are limited by the lack of a more generalized node that can efficiently decode a larger number of different constituent codes to further reduce the decoding time. In this paper, we extend a recent generalized node, the sequence repetition (SR) node to SCL decoding and we describe the first implementation of an SR-List decoder. By merging certain SR-List decoding operations and applying various optimizations for 5G New Radio (NR) polar codes, our optimized SR-List decoding algorithm increases the throughput by almost ${2\times}$ compared to a similar state-of-the-art node-based SCL decoder. We also present our hardware implementation of the optimized SR-List decoding algorithm which supports all 5G NR polar codes. Synthesis results show that our SR-List decoder can achieve a $2.94 \, \mathrm{Gbps}$ throughput and $6.70\, \mathrm{Gbps} / \mathrm{mm}^2$ area efficiency for ${L=8}$.
翻译:由于5G 的低延迟性和高可靠性要求, 低兼容性节点的连续取消列表 {SCL] 的解码在5G 通信系统中得到了相当的注意。 通过在解码树中识别特殊成份代码并立即解码这些代码, 以 SCL 为基础的 SCC 解码使得解码延迟度比常规的 SCL 解码要明显减少。 然而, 虽然存在许多节点, 目前基于节点的 SCL 解码有限, 由于缺乏一个更普遍的节点, 能够有效解码更多不同的成份代码, 以进一步减少解码时间。 在本文中, 我们将最新的通用节点、 序列重复(SR) 和 SSCL 解码的首个执行过程。 通过合并某些SR- List 解码操作, 并对基于 5G 新电台(NR) 的极值代码应用各种优化, 我们最优化的SR-L 解码算算法, 也使得我们目前S-L 294 的S- d 最高执行成本 。