On-off random access channels: A compressed sensing framework

Alyson K. Fletcher, Sundeep Rangan, Vivek K Goyal

Research output: Contribution to journalArticle

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
Original languageEnglish
Article number0903.1022
JournalarXiv
StatePublished - Mar 5 2009

Fingerprint

Compressed sensing

Keywords

  • cs.IT
  • math.IT

Cite this

Fletcher, A. K., Rangan, S., & Goyal, V. K. (2009). On-off random access channels: A compressed sensing framework. arXiv, [0903.1022].

On-off random access channels : A compressed sensing framework. / Fletcher, Alyson K.; Rangan, Sundeep; Goyal, Vivek K.

In: arXiv, 05.03.2009.

Research output: Contribution to journalArticle

@article{5b2d467bdf094de9a96912a5eaf931e9,
title = "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",
keywords = "cs.IT, math.IT",
author = "Fletcher, {Alyson K.} and Sundeep Rangan and Goyal, {Vivek K}",
note = "18 pages, 5 figures; addition of inadvertently omitted support information and acknowledgments",
year = "2009",
month = "3",
day = "5",
language = "English",
journal = "arXiv",

}

TY - JOUR

T1 - On-off random access channels

T2 - A compressed sensing framework

AU - Fletcher, Alyson K.

AU - Rangan, Sundeep

AU - Goyal, Vivek K

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

PY - 2009/3/5

Y1 - 2009/3/5

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

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

KW - cs.IT

KW - math.IT

M3 - Article

JO - arXiv

JF - arXiv

M1 - 0903.1022

ER -