A sparsity detection framework for on-off random access channels

Authors:
Alyson K. Fletcher;Sundeep Rangan;Vivek K. Goyal
Affiliations:
University of California, Berkeley;Qualcomm Technologies;Massachusetts Institute of Technology
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Year:
2009

Citing 10
Cited 5

Minimum probability of error for asynchronous Gaussian multiple-access channels

IEEE Transactions on Information Theory
Elements of information theory

Elements of information theory
Sparse Approximate Solutions to Linear Systems

SIAM Journal on Computing
Atomic Decomposition by Basis Pursuit

SIAM Journal on Scientific Computing
Multiuser Detection

Multiuser Detection
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

IEEE Transactions on Information Theory
Compressed sensing

IEEE Transactions on Information Theory
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?

IEEE Transactions on Information Theory
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit

IEEE Transactions on Information Theory
Compressed Sensing and Redundant Dictionaries

IEEE Transactions on Information Theory

Necessary and sufficient conditions for sparsity pattern recovery

IEEE Transactions on Information Theory
Sparsity-aware estimation of CDMA system parameters

EURASIP Journal on Advances in Signal Processing - Special issue on advanced equalization techniques for wireless communications
Channel estimation and user selection in the MIMO broadcast channel

Digital Signal Processing
Efficient and reliable low-power backscatter networks

Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Efficient and reliable low-power backscatter networks

ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12

Quantified Score

Hi-index	0.07

Visualization

Abstract

This paper considers a simple on-off random multiple access channel (MAC), where n users communicate simultaneously to a single receiver. Each user is assigned a single codeword which it transmits with some probability λ over m degrees of freedom. The receiver must detect which users transmitted. We show that detection for this random MAC is mathematically equivalent to a standard sparsity detection problem. Using new results in sparse estimation we are able to estimate the capacity of these channels and compare the achieved performance of various detection algorithms. The analysis provides insight into the roles of power control and multi-user detection.