论文标题

基于序列的重复节点的连续取消列表,用于5G极性代码:算法和实现

A Sequence Repetition Node-Based Successive Cancellation List Decoder for 5G Polar Codes: Algorithm and Implementation

论文作者

Ren, Yuqing, Kristensen, Andreas Toftegaard, Shen, Yifei, Balatsoukas-Stimming, Alexios, Zhang, Chuan, Burg, Andreas

论文摘要

由于5G的低延迟和高可靠性要求,基于低复杂性节点的连续取消列表(SCL)解码已引起了5G通信系统中使用的非常关注。通过识别解码树中的特殊组成代码并立即解码这些代码,基于节点的SCL解码可显着减少与常规SCL解码相比,解码延迟的降低显着降低。但是,尽管存在多种类型的节点,但当前基于节点的SCL解码器受到缺乏更广泛的节点的限制,该节点可以有效地解码大量不同的不同构成代码以进一步减少解码时间。在本文中,我们将最新的广义节点扩展到SCL解码的序列重复(SR)节点,并描述了SR-List解码器的第一个实现。通过合并某些SR-list解码操作并对5G新无线电(NR)极性代码应用各种优化,我们优化的SR-List解码算法将吞吐量增加到几乎$ {2 \ times} $,而与类似的基于最新的节点基于节点的SCL解码器相比。我们还介绍了支持所有5G NR Polar代码的优化SR列表解码算法的硬件实现。合成结果表明,我们的SR-List解码器可以实现$ 2.94 \,\ MathRM {Gbps} $ tarput和$ 6.70 \,\ Mathrm {Gbps} / \ Mathrm {mmm}^2 $ abority for $ {l = 8} $。

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}$.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源