The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Sparse Activity Detection for Massive Connectivity
Open accessAbstract
This paper considers the massive connectivity application in which a large number of devices communicate with a base-station (BS) in a sporadic fashion. Device activity detection and channel estimation are central problems in such a scenario. Due to the large number of potential devices, the devices need to be assigned non-orthogonal signature sequences. The main objective of this paper is to show that by using random signature sequences and by exploiting sparsity in the user activity pattern, the joint user detection and channel estimation problem can be formulated as a compressed sensing single measurement vector (SMV) or multiple measurement vector (MMV) problem depending on whether the BS has a single antenna or multiple antennas and efficiently solved using an approximate message passing (AMP) algorithm. This paper proposes an AMP algorithm design that exploits the statistics of the wireless channel and provides an analytical characterization of the probabilities of false alarm and missed detection via state evolution. We consider two cases depending on whether or not the large-scale component of the channel fading is known at the BS and design the minimum mean squared error denoiser for AMP according to the channel statistics. Simulation results demonstrate the substantial advantage of exploiting the channel statistics in AMP design; however, knowing the large-scale fading component does not appear to offer tangible benefits. For the multiple-antenna case, we employ two different AMP algorithms, namely the AMP with vector denoiser and the parallel AMP-MMV, and quantify the benefit of deploying multiple antennas.
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
Andrews, J. G., Buzzi, S., Choi, W., Hanly, S. V., Lozano, A., Soong, A. C. K., & Zhang, J. C. (2014) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2014.2328098 · Cited by 8,106
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
Needell, D., & Tropp, J. A. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2008.07.002 · Cited by 4,326
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
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
Message passing algorithms for compressed sensing: I. motivation and construction
Donoho, D. L., Maleki, A., & Montanari, A. (2010) · IEEE Information Theory Workshop 2010 (ITW 2010) · doi:10.1109/itwksps.2010.5503193 · Cited by 542
The Noise-Sensitivity Phase Transition in Compressed Sensing
Donoho, D. L., Maleki, A., & Montanari, A. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2165823 · Cited by 339
Exploiting 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
Asymptotic Analysis of Complex LASSO via Complex Approximate Message Passing (CAMP)
Maleki, A., Anitori, L., Yang, Z., & Baraniuk, R. G. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2252232 · Cited by 264
Accurate Prediction of Phase Transitions in Compressed Sensing via a Connection to Minimax Denoising
Donoho, D. L., Johnstone, I., & Montanari, A. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2239356 · Cited by 177
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
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
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
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
Neighbor discovery for wireless networks via compressed sensing
Zhang, L., Luo, J., & Guo, D. (2012) · Performance Evaluation · doi:10.1016/j.peva.2012.05.003 · Cited by 67
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
On 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-citation
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
Self-citationMassive 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
“It is well known that the resulting sparse signal recovery problem from noisy measurements can be tackled with CS methods [63], [64].”
BackgroundMethodInfluentialSelf-citationLiu, 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-citationRadioUNet: Fast Radio Map Estimation With Convolutional Neural Networks
Levie, R., Yapar, Ç., Kutyniok, G., & Caire, G. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2021.3054977 · Cited by 488
Ke, M., Gao, Z., Wu, Y., Gao, X., & Schober, R. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2967175 · Cited by 417
Metadata
- Authors
- Chen, Z., Sohrabi, F., & Yu, W.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2018-04-01
- Volume
- 66
- Issue
- 7
- Pages
- 1890-1904
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2784331297
- Cited by
- 378
- References
- 22
- FWCI
- 31.31
- 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.