Joint Activity Detection and Channel Estimation for Massive Connectivity: An Information Geometry Approach

In this paper, we propose an information geometry (IG) approach for joint activity detection and channel estimation (JADCE) in a massive connectivity scenario, where a large number of devices access a base station (BS) in a sporadic fashion. We formulate the JADCE problem as a classic sparse signal recovery problem, known as the multiple measurement vector (MMV) problem, and we convert it to several single measurement vector (SMV) problems to resolve it in an iterative way. To compute the marginal mean from a high-dimensional joint probability density function (PDF), we construct auxiliary manifolds (AMs) and the objective manifold for each SMV stage. While the Bernoulli-Gaussian priors cause the manifolds to be not e-flat, we can calculate the approximations of auxiliary manifolds since the sparse user transmission patterns. Simulation results demonstrate that this approximation holds an accurate performance and the proposed IG-JADCE has a better convergence rate than the approximate message passing (AMP) algorithm.

Authors

Institutions

Publication Details

Published
2024-10-24
DOI
https://doi.org/10.1109/wcsp62071.2024.10826950
Primary Topic
Advanced Memory and Neural Computing
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 Massive Connectivity: An Information Geometry Approach

Xiqi Gao, An-An Lu, Mingrui Fan
Advanced Memory and Neural Computing
article

Joint Activity Detection and Channel Estimation for Massive Connectivity: An Information Geometry Approach

Xiqi Gao, An-An Lu, Mingrui Fan
article en

Abstract

In this paper, we propose an information geometry (IG) approach for joint activity detection and channel estimation (JADCE) in a massive connectivity scenario, where a large number of devices access a base station (BS) in a sporadic fashion. We formulate the JADCE problem as a classic sparse signal recovery problem, known as the multiple measurement vector (MMV) problem, and we convert it to several single measurement vector (SMV) problems to resolve it in an iterative way. To compute the marginal mean from a high-dimensional joint probability density function (PDF), we construct auxiliary manifolds (AMs) and the objective manifold for each SMV stage. While the Bernoulli-Gaussian priors cause the manifolds to be not e-flat, we can calculate the approximations of auxiliary manifolds since the sparse user transmission patterns. Simulation results demonstrate that this approximation holds an accurate performance and the proposed IG-JADCE has a better convergence rate than the approximate message passing (AMP) algorithm.

Southeast University (CN)
National Natural Science Foundation of China, Major Basic Research Project of the Natural Science Foundation of the Jiangsu Higher Education Institutions, Fundamental Research Funds for the Central Universities
Openalex Percentile: Top 76%
Advanced Memory and Neural Computing
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.

Joint Activity Detection and Channel Estimation for Massive Connectivity: An Information Geometry Approach — Xiqi Gao, An-An Lu, et al. · (2024) | TGRS Research Map | TGRS