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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Joint Activity Detection and Channel Estimation for MIMO Grant-Free Random Access through Bayesian Learning

Boran Yang, George K. Karagiannidis, Li Hao, Xiaoxu Zhang et al.
Distributed Sensor Networks and Detection Algorithms
article

Joint Activity Detection and Channel Estimation for MIMO Grant-Free Random Access through Bayesian Learning

Boran Yang, George K. Karagiannidis, Li Hao, Xiaoxu Zhang, Pingzhi Fan
article en

Abstract

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.

Aristotle University of Thessaloniki (GR), Southwest Jiaotong University (CN)
National Science Foundation
Openalex Percentile: Top 71%
Distributed Sensor Networks and Detection Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.