A sparsity detection framework for on-off random access channels

Alyson K. Fletcher, Sundeep Rangan, Vivek K. Goyal

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publication2009 IEEE International Symposium on Information Theory, ISIT 2009
Pages169-173
Number of pages5
DOIs
StatePublished - 2009
Event2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of
Duration: Jun 28 2009Jul 3 2009

Other

Other2009 IEEE International Symposium on Information Theory, ISIT 2009
CountryKorea, Republic of
CitySeoul
Period6/28/097/3/09

Fingerprint

Multiuser detection
Random Access
Sparsity
Power control
Multiple Access Channel
Receiver
Multiuser Detection
Power Control
Degree of freedom
Estimate
Framework

ASJC Scopus subject areas

  • Applied Mathematics
  • Modeling and Simulation
  • Theoretical Computer Science
  • Information Systems

Cite this

Fletcher, A. K., Rangan, S., & Goyal, V. K. (2009). A sparsity detection framework for on-off random access channels. In 2009 IEEE International Symposium on Information Theory, ISIT 2009 (pp. 169-173). [5205769] https://doi.org/10.1109/ISIT.2009.5205769

A sparsity detection framework for on-off random access channels. / Fletcher, Alyson K.; Rangan, Sundeep; Goyal, Vivek K.

2009 IEEE International Symposium on Information Theory, ISIT 2009. 2009. p. 169-173 5205769.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fletcher, AK, Rangan, S & Goyal, VK 2009, A sparsity detection framework for on-off random access channels. in 2009 IEEE International Symposium on Information Theory, ISIT 2009., 5205769, pp. 169-173, 2009 IEEE International Symposium on Information Theory, ISIT 2009, Seoul, Korea, Republic of, 6/28/09. https://doi.org/10.1109/ISIT.2009.5205769
Fletcher AK, Rangan S, Goyal VK. A sparsity detection framework for on-off random access channels. In 2009 IEEE International Symposium on Information Theory, ISIT 2009. 2009. p. 169-173. 5205769 https://doi.org/10.1109/ISIT.2009.5205769
Fletcher, Alyson K. ; Rangan, Sundeep ; Goyal, Vivek K. / A sparsity detection framework for on-off random access channels. 2009 IEEE International Symposium on Information Theory, ISIT 2009. 2009. pp. 169-173
@inproceedings{d2008761a53b49e0ab054dc0b6c81a38,
title = "A sparsity detection framework for on-off random access channels",
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.",
author = "Fletcher, {Alyson K.} and Sundeep Rangan and Goyal, {Vivek K.}",
year = "2009",
doi = "10.1109/ISIT.2009.5205769",
language = "English (US)",
isbn = "9781424443130",
pages = "169--173",
booktitle = "2009 IEEE International Symposium on Information Theory, ISIT 2009",

}

TY - GEN

T1 - A sparsity detection framework for on-off random access channels

AU - Fletcher, Alyson K.

AU - Rangan, Sundeep

AU - Goyal, Vivek K.

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=70449469510&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70449469510&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2009.5205769

DO - 10.1109/ISIT.2009.5205769

M3 - Conference contribution

SN - 9781424443130

SP - 169

EP - 173

BT - 2009 IEEE International Symposium on Information Theory, ISIT 2009

ER -