A sparsity detection framework for on-off random access channels

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

doi:10.1109/ISIT.2009.5205769

A sparsity detection framework for on-off random access channels

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

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	2009 IEEE International Symposium on Information Theory, ISIT 2009
Pages	169-173
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2009.5205769
State	Published - 2009
Event	2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of Duration: Jun 28 2009 → Jul 3 2009

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8102

Other

Other	2009 IEEE International Symposium on Information Theory, ISIT 2009
Country/Territory	Korea, Republic of
City	Seoul
Period	6/28/09 → 7/3/09

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2009.5205769

Cite this

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 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference 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, IEEE International Symposium on Information Theory - Proceedings, 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

@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",

series = "IEEE International Symposium on Information Theory - Proceedings",

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

AN - SCOPUS:70449469510

SN - 9781424443130

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 169

EP - 173

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

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

Y2 - 28 June 2009 through 3 July 2009

ER -

A sparsity detection framework for on-off random access channels

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this