On-Off Random Access Channels: A Compressed Sensing Framework

Abstract

This paper considers a simple on-off random multiple access channel, where n users communicate simultaneously to a single receiver over m degrees of freedom. Each user transmits with probability lambda, where typically lambda n < m << n, and the receiver must detect which users transmitted. We show that when the codebook has i.i.d. Gaussian entries, detecting which users transmitted is mathematically equivalent to a certain sparsity detection problem considered in compressed sensing. Using recent sparsity results, we derive upper and lower bounds on the capacities of these channels. We show that common sparsity detection algorithms, such as lasso and orthogonal matching pursuit (OMP), can be used as tractable multiuser detection schemes and have significantly better performance than single-user detection. These methods do achieve some near-far resistance but--at high signal-to-noise ratios (SNRs)--may achieve capacities far below optimal maximum likelihood detection. We then present a new algorithm, called sequential OMP, that illustrates that iterative detection combined with power ordering or power shaping can significantly improve the high SNR performance. Sequential OMP is analogous to successive interference cancellation in the classic multiple access channel. Our results thereby provide insight into the roles of power control and multiuser detection on random-access signalling.

18 pages, 5 figures; addition of inadvertently omitted support information and acknowledgments

References in corpus (4)

• Compressed Sensing and Redundant Dictionaries
• Necessary and Sufficient Conditions on Sparsity Pattern Recovery
• Sharp thresholds for high-dimensional and noisy recovery of sparsity
• Information-theoretic limits on sparse signal recovery: Dense versus sparse measurement matrices

Cited by in corpus (16)

• Necessary and Sufficient Conditions on Sparsity Pattern Recovery
• Asymptotic Analysis of MAP Estimation via the Replica Method and Applications to Compressed Sensing
• Sparse Signal Processing Concepts for Efficient 5G System Design
• Asynchronous Code-Division Random Access Using Convex Optimization
• Perturbation Analysis of Orthogonal Matching Pursuit
• Generalized Approximate Message Passing for Estimation with Random Linear Mixing
• Orthogonal Matching Pursuit: A Brownian Motion Analysis
• Applications of Compressed Sensing in Communications Networks
• Compressive Link Acquisition in Multiuser Communications
• Optimal incorporation of sparsity information by weighted ${\ell }_1$ optimization
• Performance Limits with Additive Error Metrics in Noisy Multi-Measurement Vector Problem
• IoT Random Access in Massive MIMO: Exploiting Diversity in Sensing Matrices
• Achieving the Scaling Law of SNR-Monitoring in Dynamic Wireless Networks
• Multiuser Detection for Random Access Bandwidth Request in WiMAX
• Sparse Signal Recovery for Binary Compressed Sensing by Majority Voting Neural Networks
• High SNR Consistent Compressive Sensing