On the Identifiability of Semi-Blind Estimation in Cell-Free Massive MIMO Networks
Christian Forsch, Laura Cottatellucci

TL;DR
This paper analyzes the conditions for unique semi-blind channel and data recovery in large-scale cell-free massive MIMO networks, considering spatial distribution and connectivity.
Contribution
It introduces a probabilistic framework modeling network topology as a bipartite random geometric graph to analyze identifiability conditions.
Findings
Identifiability region depends on AP and UE densities and connectivity radius.
Graph approximation accurately predicts the success probability of semi-blind recovery.
Network density and connectivity significantly influence the feasibility of semi-blind estimation.
Abstract
Semi-blind joint channel estimation and data detection (JCD) is a promising approach to mitigate pilot contamination in cell-free massive multiple-input multiple-output (CF-MaMIMO) networks. The effectiveness of such methods fundamentally depends on identifiability, i.e., the ability to unambiguously recover the unknown channel coefficients and transmitted data signals from the received uplink observations. In this work, we investigate the identifiability of semi-blind JCD from a large-scale system design perspective. We consider a CF-MaMIMO network in which access points (APs) and user equipments (UEs) are spatially distributed according to Poisson point processes (PPPs). The resulting network topology is modeled as bipartite random geometric graph (BRGG) that captures local connectivity induced by wireless propagation. To enable a tractable analysis, the spatially dependent graph…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
