The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Compressive Sensing-Based Adaptive Active User Detection and Channel Estimation: Massive Access Meets Massive MIMO
Open accessAbstract
This paper considers massive access in massive multiple-input multiple-output (MIMO) systems and proposes an adaptive active user detection and channel estimation scheme based on compressive sensing. By exploiting the sporadic traffic of massive connected user equipments and the virtual angular domain sparsity of massive MIMO channels, the proposed scheme can support massive access with dramatically reduced access latency. Specifically, we design non-orthogonal pseudo-random pilots for uplink broadband massive access, and formulate the active user detection and channel estimation as a generalized multiple measurement vector compressive sensing problem. Furthermore, by leveraging the structured sparsity of the uplink channel matrix, we propose an efficient generalized multiple measurement vector approximate message passing (GMMV-AMP) algorithm to realize joint active user detection and channel estimation based on a spatial domain or an angular domain channel model. To jointly exploit the channel sparsity present in both the spatial and the angular domains for enhanced performance, a Turbo-GMMV-AMP algorithm is developed for detecting the active users and estimating their channels in an alternating manner. Finally, an adaptive access scheme is proposed, which adapts the access latency to guarantee reliable massive access for practical systems with unknown channel sparsity level. Additionally, the state evolution of the proposed GMMV-AMP algorithm is derived to predict its performance. Simulation results demonstrate the superiority of the proposed active user detection and channel estimation schemes compared to several baseline schemes.
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
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486
Five disruptive technology directions for 5G
Boccardi, F., Heath, R. W., Lozano, A., Marzetta, T. L., & Popovski, P. (2014) · IEEE Communications Magazine · doi:10.1109/mcom.2014.6736746 · Cited by 3,709
A View of the Em Algorithm that Justifies Incremental, Sparse, and other Variants
Neal, R. M., & Hinton, G. E. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_12 · Cited by 2,187
Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
Chen, J., & Huo, X. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.881263 · Cited by 810
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
Laya, A., Alonso, L., & Alonso-Zarate, J. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.111313.00244 · Cited by 574
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
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
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
Expectation-Maximization Gaussian-Mixture Approximate Message Passing
Vila, J. P., & Schniter, P. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2272287 · Cited by 501
Spatially Common Sparsity Based Adaptive Channel Estimation and Feedback for FDD Massive MIMO
Gao, Z., Dai, L., Wang, Z., & Chen, S. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2463260 · Cited by 497
Self-citationA 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
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
Grant-Free Massive MTC-Enabled Massive MIMO: A Compressive Sensing Approach
Senel, K., & Larsson, E. G. (2018) · IEEE Transactions on Communications · doi:10.1109/tcomm.2018.2866559 · Cited by 296
Towards Massive Connectivity Support for Scalable mMTC Communications in 5G Networks
Bockelmann, C., Pratas, N. K., Wunder, G., Saur, S., Navarro, M., Gregoratti, D., Vivier, G., De Carvalho, E., Ji, Y., Stefanovic, C., et al. (2018) · IEEE Access · doi:10.1109/access.2018.2837382 · Cited by 289 · cited 1×
“However, reliable massive access for massive connectivity is not supported by the current wireless networks [3].”
BackgroundOn the convergence of approximate message passing with arbitrary matrices
Rangan, S., Schniter, P., & Fletcher, A. (2014) · 2014 IEEE International Symposium on Information Theory · doi:10.1109/isit.2014.6874830 · Cited by 279
Dynamic Compressive Sensing-Based Multi-User Detection for Uplink Grant-Free NOMA
Wang, B., Dai, L., Zhang, Y., Mir, T., & Li, J. (2016) · IEEE Communications Letters · doi:10.1109/lcomm.2016.2602264 · Cited by 223
Blind detection of SCMA for uplink grant-free multiple-access
Bayesteh, A., Yi, E., Nikopour, H., & Baligh, H. (2014) · 2014 11th International Symposium on Wireless Communications Systems (ISWCS) · doi:10.1109/iswcs.2014.6933472 · Cited by 171
Joint User Activity and Data Detection Based on Structured Compressive Sensing for NOMA
Wang, B., Dai, L., Mir, T., et al. (2016) · IEEE Communications Letters · doi:10.1109/lcomm.2016.2560180 · Cited by 167
A 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
Approximate Message Passing-Based Joint User Activity and Data Detection for NOMA
Wei, C., Liu, H., Zhang, Z., Dang, J., & Wu, L. (2016) · IEEE Communications Letters · doi:10.1109/lcomm.2016.2624297 · Cited by 151
Message passing algorithms for compressed sensing: II. analysis and validation
Donoho, D. L., Maleki, A., & Andrea Montanari, A. (2010) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itwksps.2010.5503228 · Cited by 135
Block-Sparsity-Based Multiuser Detection for Uplink Grant-Free NOMA
Du, Y., Cheng, C., Dong, B., Chen, Z., Wang, X., Fang, J., & Li, S. (2018) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2018.2872594 · Cited by 120
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
Blind Signal Detection in Massive MIMO: Exploiting the Channel Sparsity
Zhang, J., Yuan, X., & Zhang, Y. A. (2017) · IEEE Transactions on Communications · doi:10.1109/tcomm.2017.2761384 · Cited by 95
Lin, X., Wu, S., Jiang, C., Kuang, L., Yan, J., & Hanzo, L. (2018) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2018.2818142 · Cited by 95
Massive MIMO Unsourced Random AccessPreprint
Fengler, A., Caire, G., Jung, P., & Haghighatshoar, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.00828 · Cited by 79
Grant-Free Rateless Multiple Access: A Novel Massive Access Scheme for Internet of Things
Zhang, Z., Wang, X., Zhang, Y., & Chen, Y. (2016) · IEEE Communications Letters · doi:10.1109/lcomm.2016.2593447 · Cited by 75
A Graph-Based Random Access Protocol for Crowded Massive MIMO Systems
Han, H., Li, Y., & Guo, X. (2017) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2017.2747145 · Cited by 64
Distributed Fronthaul Compression and Joint Signal Recovery in Cloud-RAN
Rao, X., & Lau, V. K. N. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2386290 · Cited by 59
Estimation of Sparse Massive MIMO-OFDM Channels with Approximately Common Support
Lin, X., Wu, S., Kuang, L., Ni, Z., Meng, X., & Jiang, C. (2017) · IEEE Communications Letters · doi:10.1109/lcomm.2017.2657620 · Cited by 31
Compressive Massive Random Access for Massive Machine-Type Communications (mMTC)
Ke, M., Gao, Z., Wu, Y., & Meng, X. (2018) · IEEE Global Conference on Signal and Information Processing · doi:10.1109/globalsip.2018.8646496 · Cited by 8
Self-citation
Cited by
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
“Towards this end, the authors in [85] proposed a generalized multiple measurement vector approximate message passing (GMMVAMP) algorithm to adaptively detect the active devices by exploiting the virtual angular domain sparsity of the channels in an orthogonal frequency division multiplexing (OFDM) broadband system.”
BackgroundSelf-citationCellular, Wide-Area, and Non-Terrestrial IoT: A Survey on 5G Advances and the Road Toward 6G
Vaezi, M., Azari, A., Khosravirad, S. R., Shirvanimoghaddam, M., Azari, M. M., Chasaki, D., & Popovski, P. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3151028 · Cited by 631
Chataut, R., & Akl, R. (2020) · Sensors · doi:10.3390/s20102753 · Cited by 556
LEO Satellite Constellations for 5G and Beyond: How Will They Reshape Vertical Domains?
Liu, S., Gao, Z., Wu, Y., Kwan Ng, D. W., Gao, X., Wong, K.-K., Chatzinotas, S., & Ottersten, B. (2021) · IEEE Communications Magazine · doi:10.1109/mcom.001.2001081 · Cited by 244
Self-citationMassive Access for Future Wireless Communication Systems
Wu, Y., Gao, X., Zhou, S., Yang, W., Polyanskiy, Y., & Caire, G. (2020) · IEEE Wireless Communications · doi:10.1109/mwc.001.1900494 · Cited by 241
“Here we provide some simulation results for the massive access in massive MIMO systems in [12].”
BackgroundMethodInfluentialSelf-citation
Metadata
- Authors
- Ke, M., Gao, Z., Wu, Y., Gao, X., & Schober, R.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2020
- Volume
- 68
- Pages
- 764-779
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W3001370401
- Cited by
- 417
- References
- 32
- FWCI
- 37.51
- 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.