arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1411.7286cs.ITmath.IT
收藏

极化码的混合译码算法与结构

Algorithm and Architecture for Hybrid Decoding of Polar Codes

Bo Yuan, Keshab K. Parhi

摘要:

极化码是第一个可证明的实现容量的前向纠错(FEC)码。通常,极化码可以经由连续消除(SC)或置信传播(BP)解码算法来解码。然而,迄今为止,极化码的实际应用受到长解码延迟和有限纠错性能问题的阻碍。在本文中,我们最近提出的BP算法的早期停止标准的基础上,我们提出了一种混合BP-SC解码方案,以提高具有相对较短的延迟的极化码的解码性能。仿真结果表明,对于(1024,512)极化码,在整个信噪比范围内,在相同的最大迭代次数下,该方法比BP算法至少有0.2dB的解码增益;在高信噪比范围内,在相同的最差时延下,该方法比BP算法有0.2dB的解码增益。此外,与SC算法相比,该方案在中等信噪比范围内获得了0.2dB的增益,且平均解码延迟更小。此外,我们还提出了低复杂度的统一硬件架构的混合解码方案,这是能够实现SC和BP算法使用相同的硬件。

英文摘要:

Polar codes are the first provable capacity-achieving forward error correction (FEC) codes. In general polar codes can be decoded via either successive cancellation (SC) or belief propagation (BP) decoding algorithm. However, to date practical applications of polar codes have been hindered by the long decoding latency and limited error-correcting performance problems. In this paper, based on our recent proposed early stopping criteria for the BP algorithm, we propose a hybrid BP-SC decoding scheme to improve the decoding performance of polar codes with relatively short latency. Simulation results show that, for (1024, 512) polar codes the proposed approach leads to at least 0.2dB gain over the BP algorithm with the same maximum number of iterations for the entire SNR region, and also achieves 0.2dB decoding gain over the BP algorithm with the same worst-case latency in the high SNR region. Besides, compared to the SC algorithm, the proposed scheme leads to 0.2dB gain in the medium SNR region with much less average decoding latency. In addition, we also propose the low-complexity unified hardware architecture for the hybrid decoding scheme, which is able to implement SC and BP algorithms using same hardware.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑