论文标题

使用Gabor词典和贝叶斯解码的恒定重量代码用于大规模随机访问

Constant Weight Codes with Gabor Dictionaries and Bayesian Decoding for Massive Random Access

论文作者

Agostini, Patrick, Utkovski, Zoran, Decurninge, Alexis, Guillaud, Maxime, Stanczak, Slawomir

论文摘要

本文考虑了一个基于稀疏叠加编码的大规模随机访问的一般框架。我们为代码设计提供指南,并建议使用恒定重量代码与基于Gabor框架的字典设计结合使用。解码器通过在解释字典结构的AMP模块之间迭代交换软信息,应用了近似消息传递(AMP)的扩展,以及使用涉及恒定重量代码的结构的第二个推理模块。我们将编码结构应用于(i)未包含的随机访问设置,所有用户使用通用字典,以及(ii)使用特定于用户的词典的“来源”随机访问设置。当应用于褪色方案时,通信方案基本上是非互操作的,因为在发射器上也不需要在接收器上进行通道状态信息。我们观察到,根据实际利益的制度,该计划与最先进的计划相比,就(每个用户)的每位能量要求以及可以同时容纳在系统中的活跃用户数量而言。重要的是,这是通过较小的传输代码字尺寸实现的,可能会产生较低的延迟和带宽的占用率,以及较低的实现复杂性。

This paper considers a general framework for massive random access based on sparse superposition coding. We provide guidelines for the code design and propose the use of constant-weight codes in combination with a dictionary design based on Gabor frames. The decoder applies an extension of approximate message passing (AMP) by iteratively exchanging soft information between an AMP module that accounts for the dictionary structure, and a second inference module that utilizes the structure of the involved constant-weight code. We apply the encoding structure to (i) the unsourced random access setting, where all users employ a common dictionary, and (ii) to the "sourced" random access setting with user-specific dictionaries. When applied to a fading scenario, the communication scheme essentially operates non-coherently, as channel state information is required neither at the transmitter nor at the receiver. We observe that in regimes of practical interest, the proposed scheme compares favorably with state-of-the art schemes, in terms of the (per-user) energy-per-bit requirement, as well as the number of active users that can be simultaneously accommodated in the system. Importantly, this is achieved with a considerably smaller size of the transmitted codewords, potentially yielding lower latency and bandwidth occupancy, as well as lower implementation complexity.

扫码加入交流群

加入微信交流群

微信交流群二维码

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