Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 9 min ago
PreprintCC BY 4.0arXiv

Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks

Abstract

This paper studies distortion-aware clustering for uplink fronthaul-limited cell-free MIMO networks employing maximum ratio combining (MRC). While MRC is appealing for its low-complexity, its performance is limited by interference, fronthaul distortions, and channel imperfections. This motivates clustering strategies that compensate for these impairments through coordination of access points. Since instantaneous small-scale fading-based optimization is not scalable in large systems, and is impractical due to frequent channel variations, we instead optimize an objective depending only on large-scale fading coefficients. To this end, asymptotic analysis is used to derive deterministic equivalent expressions for the average network sum rate, with focus on quantization distortion, leading to a quadratic-over-linear objective. Although maximizing such an objective under binary constraints is non-convex, we exploit its structure to develop a polynomial time scheme that attains the global optimum. Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search.

Related

  1. GNN-Based Global CSI Reconstruction for Fronthaul-Limited Distributed MIMO Systems
    Haojin Li, Kaiqian Qu, Anbang Zhang +3
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  2. Rate-Distortion-Perception Tradeoff for Vector Gaussian Sources with Limited Common Randomness: Exact Characterization and Approximate Universality
    Wentao Wang, Shuo Shao, Ruibin Li +3
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  3. Sparsity-Corrected Tensor Clustering for Multi-Layer Networks
    Xuefei Wang, Gaorong Li, Wenyang Zhang
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  4. Two-level domain-decomposition AdaGrad method for scalable training of graph neural networks
    Laurynas Varnas, Julien Herrmann, Alexander Heinlein +2
    HALPreprintCC BY 4.0Full textNumerical analysis & scientific computingHAL
  5. A latent space hidden Markov model for clustering views in longitudinal multilayer networks
    Cecilia Manente, Marco Alfò, Silvia D'Angelo
    arXivPreprintarXiv licenceFull textStatisticsarXiv
BibTeX
@misc{li2026scalable,
  title = {{Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks}},
  author = {Zehua Li and Raviraj Adve and Israfil Bahceci and Yahia Ahmed},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.04776},
  eprint = {2610.04776},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.04776},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks
AU  - Zehua Li
AU  - Raviraj Adve
AU  - Israfil Bahceci
AU  - Yahia Ahmed
PY  - 2026
DA  - 2026/10/03
PB  - arXiv
DO  - 10.48550/arxiv.2610.04776
UR  - https://arxiv.org/abs/2610.04776
AB  - This paper studies distortion-aware clustering for uplink fronthaul-limited cell-free MIMO networks employing maximum ratio combining (MRC). While MRC is appealing for its low-complexity, its performance is limited by interference, fronthaul distortions, and channel imperfections. This motivates clustering strategies that compensate for these impairments through coordination of access points. Since instantaneous small-scale fading-based optimization is not scalable in large systems, and is impractical due to frequent channel variations, we instead optimize an objective depending only on large-scale fading coefficients. To this end, asymptotic analysis is used to derive deterministic equivalent expressions for the average network sum rate, with focus on quantization distortion, leading to a quadratic-over-linear objective. Although maximizing such an objective under binary constraints is non-convex, we exploit its structure to develop a polynomial time scheme that attains the global optimum. Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search.
ER  -