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

大规模无源随机接入中的极化编码和稀疏扩频

Polar Coding and Sparse Spreading for Massive Unsourced Random Access

Mengfan Zheng, Yongpeng Wu, Wenjun Zhang

摘要:

在本文中,我们提出了一种新的极化编码方案的无源,非协调高斯随机接入信道。我们的方案是基于稀疏扩频,处理干扰噪声和连续干扰消除(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.

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

↑