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

低容量信道中的极化编码重复

Polar Coded Repetition for Low-Capacity Channels

Fariba Abbasi, Hessam Mahdavifar, Emanuele Viterbo

摘要:

构造具有低复杂度编码和解码的高效低速率纠错码对于涉及诸如物联网(IoT)网络之类的超低功率设备的应用已经变得越来越重要。为此,基于以中等速率将现有技术的码与重复码级联的方案已经成为部署在各种标准中的实际解决方案。在本文中,我们提出了一种新的机制,用于级联外部极化码与内部重复码,我们称之为极化编码重复。更具体地说,我们建议通过在每个重复块处的一定数量的极化递归中偏离Arikan的标准2 x 2内核来传输稍微修改的极化码字。我们展示了这种修改如何提高极性重复方案的渐近可实现速率,同时确保整体编码和解码复杂度保持几乎相同。分析了二进制擦除信道(BEC)的可达速率。

英文摘要:

Constructing efficient low-rate error-correcting codes with low-complexity encoding and decoding have become increasingly important for applications involving ultra-low-power devices such as Internet-of-Things (IoT) networks. To this end, schemes based on concatenating the state-of-the-art codes at moderate rates with repetition codes have emerged as practical solutions deployed in various standards. In this paper, we propose a novel mechanism for concatenating outer polar codes with inner repetition codes which we refer to as polar coded repetition. More specifically, we propose to transmit a slightly modified polar codeword by deviating from Arikan's standard 2 x 2 Kernel in a certain number of polarization recursions at each repetition block. We show how this modification can improve the asymptotic achievable rate of the polar-repetition scheme, while ensuring that the overall encoding and decoding complexity is kept almost the same. The achievable rate is analyzed for the binary erasure channels (BEC).

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

↑