基于前向纠错编码的非正交大规模接入稀疏签名
Sparse Signatures with Forward Error Correction Coding for Non-Orthogonal Massive Access
摘要：
在具有短分组的大规模连接场景中，感兴趣的是用户以非正交方式共享无线资源的机制。小的有效载荷与零星的用户激活相结合的方法，共同解决用户访问共享资源和信道码的设计要求。在本文中，我们提出了一种传输方案，结合稀疏签名与有限长度的前向纠错（FEC）编码的非正交大规模访问。我们的签名设计是基于欧拉平方，这是准循环部分几何的特殊情况下，产生稀疏图具有良好的解码性能。根据图论的方法，我们阐述了编码方案的好处，涉及联合用户检测和解码的接收机处理。所提出的构造是灵活的，并且可以明确地表征为大量的系统参数的组合，适合于基于授权和免授权的大规模访问。最后，不同于常见的现有方案，我们的方案可以应用于无源随机接入（U-RA）。我们数值表征系统参数之间的权衡，如用户数，负载和信道编码速率。对最先进的性能评估说明了该计划的潜力，提供一个节能的解决方案，U-RA。
英文摘要：
In massive connectivity scenarios with short packets, of interest is the regime where users share wireless resources in a non-orthogonal fashion. Small payloads combined with sporadic user activation call for approaches that jointly address the users access to the shared resources and the design of the channel code. In this paper, we propose a transmission scheme that combines sparse signatures with finite-length forward error correction (FEC) coding for non-orthogonal massive access. Our signature design is based on Euler squares, which are special instances of quasi-cyclic partial geometries that yield sparse graphs with favorable decoding properties. Following a graph-theoretic approach, we explicate the benefits of the coding scheme for the receiver processing that involves joint user detection and decoding. The proposed construction is flexible and can be explicitly characterized for a large number of combinations of system parameters, suitable for both grant-based and grant-free massive access. Finally, unlike common existing schemes, our scheme can be applied to unsourced random access (U-RA). We numerically characterize the trade-off between system parameters such as number of users, load and channel coding rate. The performance evaluation against the state of the art illustrates the potential of the scheme to provide an energy-efficient solution for U-RA.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
