EUVIMEDEUVIMED entdecken
Crossref

Max–Min Fairness via a Deep-Cut Ellipsoid Algorithm for Massive MIMO Downlink Channels

Hernan X. Cordova

IEEE Communications Letters · 2026 · 30 · 3631-3635

DOI: 10.1109/lcomm.2026.3742639 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Communications Letters, 2026. Verfasst von Hernan X. Cordova. Die Arbeit nennt 24 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The max-min fair (MMF) criterion guarantees every user a minimum rate, but for three or more users it is NP-hard, and existing global certificates rely on linear beamforming and scale with the antenna count. We present a general one: for massive MIMO it returns a deterministic, relaxation-independent certificate of MMF optimality for any convex compact rate region, via an exact convex reformulation—Sion’s minimax theorem plus MAC-BC duality—solved by a deep-cut ellipsoid. Under zero-forcing the cost of fairness decays inversely with the degrees of freedom, with an antenna threshold confirmed by simulation and extended to correlated channels.

Zitieren

APA

Cordova, H. X. (2026). Max–Min Fairness via a Deep-Cut Ellipsoid Algorithm for Massive MIMO Downlink Channels. IEEE Communications Letters, 30, 3631-3635. https://doi.org/10.1109/lcomm.2026.3742639

Vancouver

Cordova HX. Max–Min Fairness via a Deep-Cut Ellipsoid Algorithm for Massive MIMO Downlink Channels. IEEE Communications Letters. 2026;30:3631-3635. doi:10.1109/lcomm.2026.3742639

BibTeX
@article{Cordova2026,
  author = {Cordova, Hernan X.},
  title = {Max–Min Fairness via a Deep-Cut Ellipsoid Algorithm for Massive MIMO Downlink Channels},
  journal = {IEEE Communications Letters},
  year = {2026},
  volume = {30},
  pages = {3631--3635},
  doi = {10.1109/lcomm.2026.3742639}
}
Kostenlos starten →