Massive Connectivity With Massive MIMO—Part I: Device Activity Detection and Channel Estimation
Open accessThe DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Abstract
This two-part paper considers an uplink massive device communication scenario in which a large number of devices are connected to a base station (BS), but user traffic is sporadic so that in any given coherence interval, only a subset of users is active. The objective is to quantify the cost of active user detection and channel estimation and to characterize the overall achievable rate of a grant-free two-phase access scheme in which device activity detection and channel estimation are performed jointly using pilot sequences in the first phase and data is transmitted in the second phase. In order to accommodate a large number of simultaneously transmitting devices, this paper studies an asymptotic regime where the BS is equipped with a massive number of antennas. The main contributions of Part I of this paper are as follows. First, we note that as a consequence of having a large pool of potentially active devices but limited coherence time, the pilot sequences cannot all be orthogonal. However, despite the nonorthogonality, this paper shows that in the asymptotic massive multiple-input multiple-output regime, both the missed device detection and the false alarm probabilities for activity detection can always be made to go to zero by utilizing compressed sensing techniques that exploit sparsity in the user activity pattern. Part II of this paper further characterizes the achievable rates using the proposed scheme and quantifies the cost of using nonorthogonal pilot sequences for channel estimation in achievable rates.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Sparse signal processing provides a promising modeling framework to simultaneously detect the active devices and estimate their channels [75], [76], which is supported by various efficient algorithms, including the approximate message passing algorithm [184], [185] and DNN algorithm unrolling approach [97], [186].”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [184]
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
Massive MIMO for next generation wireless systems
Larsson, E. G., Edfors, O., Tufvesson, F., & Marzetta, T. L. (2014) · IEEE Communications Magazine · doi:10.1109/mcom.2014.6736761 · Cited by 6,779
Noncooperative Cellular Wireless with Unlimited Numbers of Base Station Antennas
Marzetta, T. L. (2010) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2010.092810.091092 · Cited by 6,302
Energy and spectral efficiency of very large multiuser MIMO systems
Ngo, H. Q., Larsson, E. G., & Marzetta, T. L. (2013) · IEEE Transactions on Communications · doi:10.1109/tcomm.2013.020413.110848 · Cited by 3,173
Message-passing algorithms for compressed sensing
Donoho, D. L., Maleki, A., & Montanari, A. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0909892106 · Cited by 2,416
Massive MIMO in the UL/DL of Cellular Networks: How Many Antennas Do We Need?
Hoydis, J., ten Brink, S., & Debbah, M. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.130205 · Cited by 2,361
Generalized approximate message passing for estimation with random linear mixing
Rangan, S. (2011) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2011.6033942 · Cited by 1,103
The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
Bayati, M., & Montanari, A. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2094817 · Cited by 780
Massive machine-type communications in 5g: physical and MAC-layer solutions
Bockelmann, C., Pratas, N., Nikopour, H., Au, K., Svensson, T., Stefanovic, C., Popovski, P., & Dekorsy, A. (2016) · IEEE Communications Magazine · doi:10.1109/mcom.2016.7565189 · Cited by 748
Wagner, S., Couillet, R., Debbah, M. A., & Slock, D. T. M. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2191700 · Cited by 599
Random access for machine-to-machine communication in LTE-advanced networks: issues and approaches
Hasan, M., Hossain, E., & Niyato, D. (2013) · IEEE Communications Magazine · doi:10.1109/mcom.2013.6525600 · Cited by 563
Wagner, S., Member, S., Couillet, R., & Slock, D. T. M. (2012) · HAL · Cited by 479
Sparse Activity Detection for Massive Connectivity
Chen, Z., Sohrabi, F., & Yu, W. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2795540 · Cited by 378
Self-citationExploiting Sparse User Activity in Multiuser Detection
Zhu, H., & Giannakis, G. B. (2011) · IEEE Transactions on Communications · doi:10.1109/tcomm.2011.121410.090570 · Cited by 277
Efficient High-Dimensional Inference in the Multiple Measurement Vector Problem
Ziniel, J., & Schniter, P. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2222382 · Cited by 166
Massive Connectivity With Massive MIMO—Part II: Achievable Rate Characterization
Liu, L., & Yu, W. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2818070 · Cited by 155
Self-citationA Random Access Protocol for Pilot Allocation in Crowded Massive MIMO Systems
Björnson, E., de Carvalho, E., Sørensen, J. H., Larsson, E. G., & Popovski, P. (2017) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2017.2660489 · Cited by 152
Sparse Signal Processing Concepts for Efficient 5G System Design
Wunder, G., Boche, H., Strohmer, T., & Jung, P. (2015) · IEEE Access · doi:10.1109/access.2015.2407194 · Cited by 146
Capacity of Gaussian Many-Access Channels
Chen, X., Chen, T., & Guo, D. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2668391 · Cited by 140
Exploiting Sparsity in Channel and Data Estimation for Sporadic Multi-User Communication
Schepker, H., Bockelmann, C., & Dekorsy, A. (2013) · Cited by 125
Energy and Spectral Efficiency of Very Large Multiuser MIMO Systems
SinghParihar, P., Saraswat, R., & Maheshwari, S. (2015) · International Journal of Computer Applications · doi:10.5120/19532-1175 · Cited by 102
Active user detection and channel estimation in uplink CRAN systems
Xu, X. X., Rao, X., & Lau, V. K. N. (2015) · International Conference on Communications · doi:10.1109/icc.2015.7248738 · Cited by 101
Code-expanded random access for machine-type communications
Pratas, N. K., Thomsen, H., Stefanović, Č., et al. (2012) · IEEE Globecom Workshops (GC Wkshps) · doi:10.1109/glocomw.2012.6477838 · Cited by 96
The dynamics of message passing on dense graphs, with applications to compressed sensing
Bayati, M., & Andrea Montanari, A. (2010) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2010.5513529 · Cited by 92
Compressive random access for post-LTE systems
Wunder, G., Jung, P., & Chen, W. (2014) · IEEE International Conference on Communications workshops · doi:10.1109/iccw.2014.6881254 · Cited by 89
Belief propagation for joint sparse recoveryPreprint
Kim, J., Chang, W., Jung, B. C., et al. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1102.3289 · Cited by 66
Joint channel estimation and activity detection for multiuser communication systems
Hannák, G., Mayer, M., Jung, A., Matz, G., & Goertz, N. (2015) · doi:10.1109/iccw.2015.7247489 · Cited by 59
Compressive Random Access Using a Common Overloaded Control Channel
Wunder, G., Jung, P., & Ramadan, M. (2015) · IEEE Globecom Workshops (GC Wkshps) · doi:10.1109/glocomw.2015.7414186 · Cited by 53
Compressive Sensing Multi-User Detection with Block-Wise Orthogonal Least Squares
Schepker, H., & Dekorsy, A. (2012) · IEEE Vehicular Technology Conference · doi:10.1109/vetecs.2012.6240301 · Cited by 45
Massive device activity detection by approximate message passing
Chen, Z., & Yu, W. (2017) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2017.7952810 · Cited by 44
Self-citationOn the fundamental limits of massive connectivity
Yu, W. (2017) · Information Theory and Applications Workshop (ITA) · doi:10.1109/ita.2017.8023482 · Cited by 40
Self-citationMassive device connectivity with massive MIMO
Liu, L., & Yu, W. (2017) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8006693 · Cited by 23
Self-citation
Research works printed but not linked: 2
- gautschi, 2011, The incomplete Gamma functions since Tricomi, Atti dei Convegni Linci, 203
- pratas, 0, Codeexpanded random access for machine-type communications, Proc IEEE GLOBECOM Workshops, 1681
Cited by
Wang, Z., Liu, L., & Cui, S. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.3004330 · Cited by 914
Self-citationEdge artificial intelligence for 6g: vision, enabling technologies, and applications
Letaief, K. B., Shi, Y., Lu, J., & Lu, J. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3126076 · Cited by 829
“…provides a promising modeling framework to simultaneously detect the active devices and estimate their channels [75], [76], which is supported by various efficient algorithms, including the approximate message passing algo-rithm [184], [185] and DNN algorithm unrolling approach [186], [97].”
MethodMassive 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
Self-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
Self-citation
Metadata
- Authors
- Liu, L., & Yu, W.
- Affiliations
- University of Toronto (CA)
- ORCID
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2018-06-01
- Volume
- 66
- Issue
- 11
- Pages
- 2933-2946
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2706056020
- Cited by
- 686
- References
- 31
- Citations by year
- 2026: 30 · 2025: 76 · 2024: 79 · 2023: 82 · 2022: 106 · 2021: 113 · 2020: 115 · 2019: 59 · 2018: 22
- FWCI
- 29.56
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- IEEE Transactions on Signal Processing (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Natural Sciences and Engineering Research Council of Canada
- Steacie Memorial Fellowship
- Canada Research Chairs program
- Topics
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced MIMO Systems Optimization
- Physical Sciences › Engineering › Electrical and Electronic Engineering › IoT Networks and Protocols
- Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
- Keywords
- massive MIMO, massive connectivity, grant-free access, device activity detection, channel estimation, compressed sensing, missed detection probability, false alarm probability, achievable rate, asymptotic analysis
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.