论文标题
极地编码和稀疏扩展以大规模未包含的随机访问
Polar Coding and Sparse Spreading for Massive Unsourced Random Access
论文作者
论文摘要
在本文中,我们为未包含的,不协调的高斯随机访问通道提出了一种新的极地编码方案。我们的方案基于稀疏扩散,将干扰视为噪声和连续的干扰取消(SIC)。在发射机侧,每个用户都会根据某些概率分布来随机从多个选择中选择代码长度和发射功率,以编码其消息,以及一个交流者,以在整个传输块中扩散其编码的代码字位。每个用户的编码配置是通过压缩传感传输的,类似于某些以前的作品。在接收方侧,恢复了所有用户的编码配置后,它应用了单用户极地解码和SIC来恢复消息列表。数值结果表明,我们的方案优于活动用户编号的所有以前的方案$ k_a \ geq 250 $,并为$ k_a \ leq 225 $提供竞争性能。此外,与其他方案相比,我们的方案的复杂性要低得多,因为我们仅使用单用户极地编码。
In this paper, we propose a new polar coding scheme for the unsourced, uncoordinated Gaussian random access channel. Our scheme is based on sparse spreading, treat interference as noise and successive interference cancellation (SIC). On the transmitters side, each user randomly picks a code-length and a transmit power from multiple choices according to some probability distribution to encode its message, and an interleaver to spread its encoded codeword bits across the entire transmission block. The encoding configuration of each user is transmitted by compressive sensing, similar to some previous works. On the receiver side, after recovering the encoding configurations of all users, it applies single-user polar decoding and SIC to recover the message list. Numerical results show that our scheme outperforms all previous schemes for active user number $K_a\geq 250$, and provides competitive performance for $K_a\leq 225$. Moreover, our scheme has much lower complexity compared to other schemes as we only use single-user polar coding.