Low complexity schemes for the random access Gaussian channel

Or Ordentlich; Yury Polyanskiy

doi:10.1109/ISIT.2017.8006985

Low complexity schemes for the random access Gaussian channel

Or Ordentlich, Yury Polyanskiy

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

175 Scopus citations

Abstract

We consider an uncoordinated Gaussian multiple access channel with a relatively large number of active users within each block. A low complexity coding scheme is proposed, which is based on a combination of compute-and-forward and coding for a binary adder channel. For a wide regime of parameters of practical interest, the energy-per-bit required by each user in the proposed scheme is significantly smaller than that required by popular solutions such as slotted-ALOHA and treating interference as noise.

Original language	English
Title of host publication	2017 IEEE International Symposium on Information Theory, ISIT 2017
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	2528-2532
Number of pages	5
ISBN (Electronic)	9781509040964
DOIs	https://doi.org/10.1109/ISIT.2017.8006985
State	Published - 9 Aug 2017
Externally published	Yes
Event	2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany Duration: 25 Jun 2017 → 30 Jun 2017

Publication series

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

Conference

Conference	2017 IEEE International Symposium on Information Theory, ISIT 2017
Country/Territory	Germany
City	Aachen
Period	25/06/17 → 30/06/17

Bibliographical note

Publisher Copyright:
© 2017 IEEE.

Access to Document

10.1109/ISIT.2017.8006985

Cite this

Ordentlich, O., & Polyanskiy, Y. (2017). Low complexity schemes for the random access Gaussian channel. In 2017 IEEE International Symposium on Information Theory, ISIT 2017 (pp. 2528-2532). Article 8006985 (IEEE International Symposium on Information Theory - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2017.8006985

@inproceedings{4989aa54bf764562b3fb7e7040d078cc,

title = "Low complexity schemes for the random access Gaussian channel",

abstract = "We consider an uncoordinated Gaussian multiple access channel with a relatively large number of active users within each block. A low complexity coding scheme is proposed, which is based on a combination of compute-and-forward and coding for a binary adder channel. For a wide regime of parameters of practical interest, the energy-per-bit required by each user in the proposed scheme is significantly smaller than that required by popular solutions such as slotted-ALOHA and treating interference as noise.",

author = "Or Ordentlich and Yury Polyanskiy",

note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 2017 IEEE International Symposium on Information Theory, ISIT 2017 ; Conference date: 25-06-2017 Through 30-06-2017",

year = "2017",

month = aug,

day = "9",

doi = "10.1109/ISIT.2017.8006985",

language = "אנגלית",

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

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "2528--2532",

booktitle = "2017 IEEE International Symposium on Information Theory, ISIT 2017",

address = "ארצות הברית",

}

Ordentlich, O & Polyanskiy, Y 2017, Low complexity schemes for the random access Gaussian channel. in 2017 IEEE International Symposium on Information Theory, ISIT 2017., 8006985, IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 2528-2532, 2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, 25/06/17. https://doi.org/10.1109/ISIT.2017.8006985

Low complexity schemes for the random access Gaussian channel. / Ordentlich, Or; Polyanskiy, Yury.
2017 IEEE International Symposium on Information Theory, ISIT 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 2528-2532 8006985 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Low complexity schemes for the random access Gaussian channel

AU - Ordentlich, Or

AU - Polyanskiy, Yury

PY - 2017/8/9

Y1 - 2017/8/9

N2 - We consider an uncoordinated Gaussian multiple access channel with a relatively large number of active users within each block. A low complexity coding scheme is proposed, which is based on a combination of compute-and-forward and coding for a binary adder channel. For a wide regime of parameters of practical interest, the energy-per-bit required by each user in the proposed scheme is significantly smaller than that required by popular solutions such as slotted-ALOHA and treating interference as noise.

AB - We consider an uncoordinated Gaussian multiple access channel with a relatively large number of active users within each block. A low complexity coding scheme is proposed, which is based on a combination of compute-and-forward and coding for a binary adder channel. For a wide regime of parameters of practical interest, the energy-per-bit required by each user in the proposed scheme is significantly smaller than that required by popular solutions such as slotted-ALOHA and treating interference as noise.

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

U2 - 10.1109/ISIT.2017.8006985

DO - 10.1109/ISIT.2017.8006985

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85034039316

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2528

EP - 2532

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

PB - Institute of Electrical and Electronics Engineers Inc.

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

Y2 - 25 June 2017 through 30 June 2017

ER -

Low complexity schemes for the random access Gaussian channel

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this