论文标题
基于阈值的快速连续分解极性代码
Threshold-Based Fast Successive-Cancellation Decoding of Polar Codes
论文作者
论文摘要
快速SC解码通过识别SC解码树的上层中的新节点并实现其快速平行解码器，克服了SC解码的序列性引起的潜伏期。在这项工作中，我们首先提出了与特定类序列相对应的新型序列重复节点。大多数现有的特殊节点类型是所提出的序列重复节点的特殊情况。然后，为此节点提出了快速的并行解码器。为了进一步加快此类外部的一般节点的解码过程，引入了基于阈值的硬性建议方案。理论上得出了保证在提出的方案中保证给定错误校正性能的阈值值。分析和硬件实现的结果为$ 1024 $的极性代码，代码速率$ 1/4 $，$ 1/2 $和$ 3/4 $，表明我们提出的算法可将所需的时钟周期降低高达$ 8 \％$，并导致$ 10 \％的$ $ $ $ $ $ $ $ $ $ $提高，而与未经级别的差异相比，最大程度地提高了操作频率。此外，使用提出的基于阈值的硬涂层方案，可以将解码延迟进一步降低$ 57 \％$ $ \ at $ \ mathrm {e_b}/\ mathrm {n_0} = 5.0 $ 〜db。
Fast SC decoding overcomes the latency caused by the serial nature of the SC decoding by identifying new nodes in the upper levels of the SC decoding tree and implementing their fast parallel decoders. In this work, we first present a novel sequence repetition node corresponding to a particular class of bit sequences. Most existing special node types are special cases of the proposed sequence repetition node. Then, a fast parallel decoder is proposed for this class of node. To further speed up the decoding process of general nodes outside this class, a threshold-based hard-decision-aided scheme is introduced. The threshold value that guarantees a given error-correction performance in the proposed scheme is derived theoretically. Analysis and hardware implementation results on a polar code of length $1024$ with code rates $1/4$, $1/2$, and $3/4$ show that our proposed algorithm reduces the required clock cycles by up to $8\%$, and leads to a $10\%$ improvement in the maximum operating frequency compared to state-of-the-art decoders without tangibly altering the error-correction performance. In addition, using the proposed threshold-based hard-decision-aided scheme, the decoding latency can be further reduced by $57\%$ at $\mathrm{E_b}/\mathrm{N_0} = 5.0$~dB.
