论文标题

低容量通道的极地编码重复

Polar Coded Repetition for Low-Capacity Channels

论文作者

Abbasi, Fariba, Mahdavifar, Hessam, Viterbo, Emanuele

论文摘要

对于涉及涉及超低功率的设备(例如Things Internet)网络(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).

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源