一种高效的基于组成码的极化码连续抵消解码部分和生成器
An Efficient Partial Sums Generator for Constituent Code based Successive Cancellation Decoding of Polar Codes
摘要:
提出了一种用于分量码极化码译码器的部分和生成器的结构。基于组成码的极化码译码器具有低时延的优点。然而,不存在可产生用于解码器的所要时序的有目的地设计的部分和产生器设计。我们首先推导出与每个组成码对应的部分和集$\bm{β^c}$的数学表示。由此,我们构造了一个基于移位寄存器的部分和生成器。接下来,整体架构和设计细节进行了描述,并与传统的部分和发生器的开销进行了评估。最后给出了ASIC和FPGA技术的实现结果及相关讨论。
英文摘要:
This paper proposes the architecture of partial sum generator for constituent codes based polar code decoder. Constituent codes based polar code decoder has the advantage of low latency. However, no purposefully designed partial sum generator design exists that can yield desired timing for the decoder. We first derive the mathematical presentation with the partial sums set $\bm{β^c}$ which is corresponding to each constituent codes. From this, we concoct a shift-register based partial sum generator. Next, the overall architecture and design details are described, and the overhead compared with conventional partial sum generator is evaluated. Finally, the implementation results with both ASIC and FPGA technology and relevant discussions are presented.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。