Capacity of Gaussian Many-Access Channels
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Classical multiuser information theory studies the fundamental limits of models with a fixed (often small) number of users as the coding blocklength goes to infinity. This paper proposes a new paradigm, referred to as many-user information theory, where the number of users is allowed to grow with the blocklength. This paradigm is motivated by emerging systems with a massive number of users in an area, such as the Internet of Things. The focus of this paper is the many-access channel model, which consists of a single receiver and many transmitters, whose number increases unboundedly with the blocklength. Moreover, an unknown subset of transmitters may transmit in a given block and need to be identified as well as decoded by the receiver. A new notion of capacity is introduced and characterized for the Gaussian many-access channel with random user activities. The capacity can be achieved by first detecting the set of active users and then decoding their messages. The minimum cost of identifying the active users is also quantified.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Cited by
Massive Connectivity With Massive MIMO—Part I: Device Activity Detection and Channel Estimation
Liu, L., & Yu, W. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2818082 · Cited by 686
Massive Access for 5G and Beyond
Chen, X., Ng, D. W. K., Yu, W., Larsson, E. G., Al-Dhahir, N., & Schober, R. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.3019724 · Cited by 681
“The results in [43]-[45] and [48] on massive random access are based on the common assumption that the coding blocklength or the number of channel uses increases in the same order as the number of transmitters.”
BackgroundSelf-citationEvolution of NOMA Toward Next Generation Multiple Access (NGMA) for 6G
Liu, Y., Zhang, S., Mu, X., Ding, Z., Schober, R., Al-Dhahir, N., Hossain, E., & Shen, X. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2022.3145234 · Cited by 595
Liu, L., Larsson, E. G., Yu, W., Popovski, P., Stefanovic, C., & de Carvalho, E. (2018) · IEEE Signal Processing Magazine · doi:10.1109/msp.2018.2844952 · Cited by 510
A perspective on massive random-access
Polyanskiy, Y. (2017) · 2017 IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8006984 · Cited by 490
Metadata
- Authors
- Chen, X., Chen, T.-Y., & Guo, D.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2017-06
- Volume
- 63
- Issue
- 6
- Pages
- 3516-3539
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2963128632
- Cited by
- 140
- References
- 1
- FWCI
- 6.82
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.