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

带记忆的极化码

Polar Codes with Memory

Wenyue Zhou, Qiang Liu, Yifei Shen, Xiaofeng Zhou, Chuan Zhang, Yaohua Xu, Liping Li

摘要:

本文提出了一种带记忆的极化码(PCM):一对连续的码块,其中包含受控数量的互信息比特。成功块的共享互信息比特可以帮助失败块恢复。底层极化码可以采用任何解码方案,诸如连续消除(SC)解码(PCM-SC)、置信传播(BP)解码(PCM-BP)和连续消除列表(SCL)解码(PCM-SCL)。分析表明,PCM的分组出错率(PER)降低到PER平方的数量级,同时保持与底层极化码相同的复杂度。仿真结果表明,对于PCM-SC,对于块长度$N=256$,PER与具有两个列表的独立SCL解码相当(小于0.3 dB)。具有$L$列表的PCM-SCL的PER可以匹配具有$2L$列表的独立SCL解码的PER。两个硬件解码器的PCM也实现了:在串行(IS)解码器和低延迟交织(LLI)解码器。对于$N=256$,综合结果表明,在最坏的情况下,PCM LLI解码器的延迟仅为采用$L=2$的自适应SCL解码器的$16.1\%$,而吞吐量却提高了13倍。

英文摘要:

Polar codes with memory (PCM) are proposed in this paper: a pair of consecutive code blocks containing a controlled number of mutual information bits. The shared mutual information bits of the succeeded block can help the failed block to recover. The underlying polar codes can employ any decoding scheme such as the successive cancellation (SC) decoding (PCM-SC), the belief propagation (BP) decoding (PCM-BP), and the successive cancellation list (SCL) decoding (PCM-SCL). The analysis shows that the packet error rate (PER) of PCM decreases to the order of PER squared while maintaining the same complexity as the underlying polar codes. Simulation results indicate that for PCM-SC, the PER is comparable to (less than 0.3 dB) the stand-alone SCL decoding with two lists for the block length $N=256$. The PER of PCM-SCL with $L$ lists can match that of the stand-alone SCL decoding with $2L$ lists. Two hardware decoders for PCM are also implemented: the in-serial (IS) decoder and the low-latency interleaved (LLI) decoder. For $N=256$, synthesis results show that in the worst case, the latency of the PCM LLI decoder is only $16.1\%$ of the adaptive SCL decoder with $L=2$, while the throughput is improved by 13 times compared to it.

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

↑