论文标题
在插槽擦除通道上的极地斜alloha
Polar-Slotted ALOHA over Slot Erasure Channels
论文作者
论文摘要
在本文中，我们在插槽擦除通道上设计了一个新的极性插入的Aloha（PSA）协议，该协议使用极地编码来构建每个活动用户和基本站内组装相同的插槽模式（SP）。提供了PSA的理论分析框架。首先，通过将面向数据包的操作用于重叠数据包以插槽间隔冲突时，我们介绍了基于数据包的极化变换，并证明了此转换与数据包的长度无关。其次，以基于数据包的极化为指导，具有可变插槽擦除概率（SEP）的SP分配方法（SPA）方法和具有固定SEP值的SPA方法是为PSA方案设计的。然后，开发了面向数据包的连续取消（PSC）和PSC列表（PSCL）解码算法。同时，分析了PSC算法的有限插槽吞吐量和渐近吞吐量。仿真结果表明，所提出的PSA方案可以通过PSC/SCL解码算法在传统的重复插入的ALOHA方案方面实现改进的吞吐量。
In this paper, we design a new polar slotted ALOHA (PSA) protocol over the slot erasure channels, which uses polar coding to construct the identical slot pattern (SP) assembles within each active user and base station. A theoretical analysis framework for the PSA is provided. First, by using the packet-oriented operation for the overlap packets when they conflict in a slot interval, we introduce the packet-based polarization transform and prove that this transform is independent of the packet's length. Second, guided by the packet-based polarization, an SP assignment (SPA) method with the variable slot erasure probability (SEP) and a SPA method with a fixed SEP value are designed for the PSA scheme. Then, a packet-oriented successive cancellation (pSC) and a pSC list (pSCL) decoding algorithm are developed. Simultaneously, the finite-slots throughput bounds and the asymptotic throughput for the pSC algorithm are analyzed. The simulation results show that the proposed PSA scheme can achieve an improved throughput with the pSC/SCL decoding algorithm over the traditional repetition slotted ALOHA scheme.
