Metraipolis › archive › dc_2a33971ed866
Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks — arXiv:2610.04776
- Source
- arXiv
- Original
- https://arxiv.org/abs/2610.04776
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T05:32:55.375Z
- SHA-256 of the archived text
cb8d5c1446df6ce294410380e09960b4f2d9a382e4a5ffdf8aacde1e5b3fbb99- Stable URL of this page
https://metraipolis.com/documento/dc_2a33971ed866
How to cite
Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks — arXiv:2610.04776 — arXiv, https://arxiv.org/abs/2610.04776 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2a33971ed866 (Metraipolis archive dc_2a33971ed866, sha256 cb8d5c1446df6ce294410380e09960b4f2d9a382e4a5ffdf8aacde1e5b3fbb99)
BibTeX
@misc{dc2a33971ed866,
title = {Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks — arXiv:2610.04776},
howpublished = {arXiv},
url = {https://arxiv.org/abs/2610.04776},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2a33971ed866; sha256 cb8d5c1446df6ce294410380e09960b4f2d9a382e4a5ffdf8aacde1e5b3fbb99},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv, https://arxiv.org/abs/2610.04776. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.NI, nuovi lavori del giorno). Categorie arXiv: Information Theory (cs.IT) ; Networking and Internet Architecture (cs.NI); Systems and Control (eess.SY); Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2610.04776 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-06T05:27:35.329Z dalla pagina https://arxiv.org/list/cs.NI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).