Decentralized Learning Algorithm for Active User and Data Detection in mMTC CF mMIMO Systems

We consider the problem of detecting active user equipments (UEs) and their data, in a cell-free massive multiple-input multiple-output (CF-mMIMO) massive machine type communication (mMTC) systems. Due to large number of UEs in a mMTC system, data detection at each access point (AP) becomes a sparse recovery problem. By leveraging the sporadic user activity, we develop a decentralized sparse Bayesian learning algorithm, which first detects data locally for each AP, and then improves the detection performance by suitably combining information from other APs. This is done by optimizing the global objective via a local objective corresponding to each AP. We show that our decentralized Bayesian learning algorithm has a lower i) complexity and runtime than its centralized counterparts. Its complexity also remains invariant to the number of APs; and ii) bit error rate (BER) than other existing algorithms.

Authors

Institutions

Publication Details

Journal
IEEE Wireless Communications Letters
Published
2025-03-24
DOI
https://doi.org/10.1109/lwc.2025.3554460
Primary Topic
Wireless Communication Networks Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Decentralized Learning Algorithm for Active User and Data Detection in mMTC CF mMIMO Systems

Rohit Budhiraja, Yash Mishra, Anupama Rajoriya
IEEE Wireless Communications Letters
Wireless Communication Networks Research
article

Decentralized Learning Algorithm for Active User and Data Detection in mMTC CF mMIMO Systems

Rohit Budhiraja, Yash Mishra, Anupama Rajoriya
article en

Abstract

We consider the problem of detecting active user equipments (UEs) and their data, in a cell-free massive multiple-input multiple-output (CF-mMIMO) massive machine type communication (mMTC) systems. Due to large number of UEs in a mMTC system, data detection at each access point (AP) becomes a sparse recovery problem. By leveraging the sporadic user activity, we develop a decentralized sparse Bayesian learning algorithm, which first detects data locally for each AP, and then improves the detection performance by suitably combining information from other APs. This is done by optimizing the global objective via a local objective corresponding to each AP. We show that our decentralized Bayesian learning algorithm has a lower i) complexity and runtime than its centralized counterparts. Its complexity also remains invariant to the number of APs; and ii) bit error rate (BER) than other existing algorithms.

IEEE Wireless Communications LettersVol. 14(6)
Indian Institute of Technology Kanpur (IN)
Openalex Percentile: Top 95%
Wireless Communication Networks Research
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.

Decentralized Learning Algorithm for Active User and Data Detection in mMTC CF mMIMO Systems — Rohit Budhiraja, Yash Mishra, et al. · IEEE Wireless Communications Letters (2025) | TGRS Research Map | TGRS