论文标题
使用Reed-Muller代码在多电池无线网络中大量访问
Massive Access in Multi-cell Wireless Networks Using Reed-Muller Codes
论文作者
论文摘要
在5G无线系统中，为大量设备提供连接是一个关键挑战。特别是，在具有褪色和路径损失不确定性的多单元网络中开发有效的设备识别和消息解码的有效方法至关重要。在本文中，我们使用二阶Reed-Muller（RM）序列设计了这样的方案。对于给定的正整数$ m $，生成了一本代码簿，最多可$ 2^{m（m+3）/2} $长度为$ 2^m $的代码字，其中每个代码字是由带有二进制条目的矩阵矢量对确定的唯一RM序列。这允许每个设备发送$ M（M+3）/2 $位的信息，其中可以使用任意数量的这些位来表示节点的身份，其余部分代表消息。总共可以总共有$ 2^{m（m+3）/2} $设备。使用迭代算法，接入点可以估算附近设备的每个矩阵向量对，只要不是太多的设备同时发送。为了提高性能，我们还用插槽描述了增强的RM编码方案。我们表明，后一种算法的计算复杂性和误差性能都超过了另一种最新算法。这项工作中开发的设备识别和消息解码方案可以作为数十亿个设备的赠款大规模访问的基础，每个单元格中具有数百个具有数百个活跃设备的设备。
Providing connectivity to a massive number of devices is a key challenge in 5G wireless systems. In particular, it is crucial to develop efficient methods for active device identification and message decoding in a multi-cell network with fading and path loss uncertainties. In this paper, we design such a scheme using second-order Reed-Muller (RM) sequences. For given positive integer $m$, a codebook is generated with up to $2^{m(m+3)/2}$ codewords of length $2^m$, where each codeword is a unique RM sequence determined by a matrix-vector pair with binary entries. This allows every device to send $m(m+3)/2$ bits of information where an arbitrary number of these bits can be used to represent the identity of a node, and the remaining bits represent a message. There can be up to $2^{m(m+3)/2}$ devices in total. Using an iterative algorithm, an access point can estimate the matrix-vector pairs of each nearby device, as long as not too many devices transmit simultaneously. To improve the performance, we also describe an enhanced RM coding scheme with slotting. We show that both the computational complexity and the error performance of the latter algorithm exceed another state-of-the-art algorithm. The device identification and message decoding scheme developed in this work can serve as the basis for grant-free massive access for billions of devices with hundreds of simultaneously active devices in each cell.
