Joint Activity Detection and Channel Estimation for MIMO Grant-Free Random Access through Bayesian Learning
Massive machine-type communications (mMTC) are anticipated to be supported by grant-free random access (GF-RA) and multiple-input multiple-output (MIMO) techniques. Compressed sensing (CS) is extensively advocated to accommodate massive connectivity due to bursty data transmission. In this paper, we formulate the joint activity detection and channel estimation for the MIMO-enabled GF-RA system as a block single measurement vector (SMV) problem. First, the hierarchical block sparse Bayesian learning (BSBL) framework is developed to solve this problem, where the potential block sparse properties induced by multiantenna reception are exploited by assigning the structured hyperprior. Then, by integrating the generalized approximate message passing (GAMP) approach into the BSBL formulation to effectively approximate the posterior distribution, we propose a computationally efficient Bayesian learning algorithm named GAMP-BSBL. Fortunately, the proposed Bayesian algorithms enable automatic learning of block sparse solutions without requiring noise level and user sparsity ratio as explicit conditions. Simulation results show that the proposed algorithms provide improved performance gains as compared with the standard CS methods.
Authors
- Boran Yang (ORCID: https://orcid.org/0000-0002-3089-1604)
- George K. Karagiannidis (ORCID: https://orcid.org/0000-0001-8810-0345)
- Li Hao (ORCID: https://orcid.org/0000-0002-1562-3863)
- Xiaoxu Zhang (ORCID: https://orcid.org/0000-0002-6631-6177)
- Pingzhi Fan (ORCID: https://orcid.org/0000-0002-8281-6251)
Institutions
- Aristotle University of Thessaloniki (GR)
- Southwest Jiaotong University (CN)
Publication Details
- Published
- 2024-09-02
- DOI
- https://doi.org/10.1109/pimrc59610.2024.10817353
- Primary Topic
- Distributed Sensor Networks and Detection Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation