This article introduces a novel scheme, termed coded compressed sensing, for unsourced multiple-access communication. The proposed divide-and-conquer approach leverages recent advances in compressed sensing and forward error correction to produce a novel uncoordinated access paradigm, along with a computationally efficient decoding algorithm. Within this framework, every active device partitions its data into several sub-blocks and, subsequently, adds redundancy using a systematic linear block code. Compressed sensing techniques are then employed to recover sub-blocks up to a permutation of their order, and the original messages are obtained by stitching fragments together using a tree-based algorithm. The error probability and computational complexity of this access paradigm are characterized. An optimization framework, which exploits the tradeoff between performance and computational complexity, is developed to assign parity-check bits to each sub-block. In addition, two emblematic parity bit allocation strategies are examined and their performances are analyzed in the limit as the number of active users and their corresponding payloads tend to infinity. The number of channel uses needed and the computational complexity associated with these allocation strategies are established for various scaling regimes. Numerical results demonstrate that coded compressed sensing outperforms other existing practical access strategies over a range of operational scenarios.

中文翻译：

---

一种用于无源多路访问的编码压缩感知方案

本文介绍了一种用于无源多址通信的新方案，称为编码压缩感知。所提出的分而治之的方法利用压缩感知和前向纠错方面的最新进展来产生一种新颖的非协调访问范式，以及一种计算效率高的解码算法。在此框架内，每个活动设备将其数据划分为几个子块，然后使用系统的线性块代码添加冗余。然后采用压缩感知技术来恢复子块直到它们的顺序排列，并且通过使用基于树的算法将片段拼接在一起来获得原始消息。这种访问范式的错误概率和计算复杂性被表征。一个优化框架，它利用了性能和计算复杂性之间的权衡，被开发来为每个子块分配奇偶校验位。此外，研究了两种象征性的奇偶校验位分配策略，并在有限的情况下分析了它们的性能，因为活动用户的数量及其相应的有效载荷趋于无穷大。所需的信道使用数量和与这些分配策略相关的计算复杂性是针对各种缩放机制确定的。数值结果表明，编码压缩感知在一系列操作场景中优于其他现有的实际访问策略。研究了两种象征性的奇偶校验位分配策略，并在有限的情况下分析了它们的性能，因为活动用户的数量及其相应的有效载荷趋于无穷大。所需的信道使用数量和与这些分配策略相关的计算复杂性是针对各种缩放机制确定的。数值结果表明，编码压缩感知在一系列操作场景中优于其他现有的实际访问策略。研究了两种象征性的奇偶校验位分配策略，并在有限的情况下分析了它们的性能，因为活动用户的数量及其相应的有效载荷趋于无穷大。所需的信道使用数量和与这些分配策略相关的计算复杂性是针对各种缩放机制确定的。数值结果表明，编码压缩感知在一系列操作场景中优于其他现有的实际访问策略。