Searcharxiv⌕ Search

arXiv · 2610.33982

Unifying Performance and Equity via Percentile Optimization and Cell-Free Massive MIMO

Abstract

Improving the throughput of the weakest users is a central objective of wireless resource allocation, and the objective around which the user-centric cell-free massive multiple-input multiple-output (UC-mMIMO) architecture is built. This paper brings the two together by formulating and solving percentile programs for UC-mMIMO networks. We maximize the sum-least-qth-percentile (SLqP) rate via downlink power control, a utility that targets the user equipments (UEs) in the lowest q percentile of the rate distribution and subsumes max-min-rate and sum-rate maximization as special cases. The problem is non-convex, non-smooth and NP-hard. The cyclic maximization approach of one of the previous percentile optimization series does not carry over: the coherent joint transmission technique introduces cross terms in the powers that destroy the block-concavity on which it relies. We develop a change of variables that restores block-concavity, yielding an algorithm with closed-form auxiliary updates and a concave power update, and we give a self-contained proof of non-decreasing convergence to a directional stationary point. Simulations establish two facts: first, percentile optimization retains its value in an architecture with no cell edges; relative to the weighted minimum mean-square error benchmark, it raises the average rate of the lowest-10th-percentile UEs by 56--72% and Jain's fairness index from below 0.92 to above 0.99. Second, compared directly with massive MIMO and small cells under the same SLqP utility, UC-mMIMO delivers the highest lower-percentile rates at every access point density tested, by up to 62% and 2.7$\times$ respectively, at the same fairness, and its advantage widens with densification.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ahmad Khan, Hussein A. Ammar, Raviraj Adve. 2026-10-25. Unifying Performance and Equity via Percentile Optimization and Cell-Free Massive MIMO. https://arxiv.org/abs/2610.33982

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Hierarchical Joint Source-Channel Coding with Constrained Information Leakage

This paper studies the hierarchical joint source-channel coding with information leakage constraint in the first-phase reconstruction and distortion constraints. The receiver's access to the data varies and is evaluated by the quality of the side information. Due to the consideration of channel capacity limitation or the efficiency of the system performance, the encoder may send some additional information in Phase 1 that can only be decoded in Phase 2 with higher-quality side information. While this can optimize the overall performance, the additional information causes excessive information leakage. We provide general inner and outer bounds for the conditions such that a given distortion-leakage pair $(D_1,D_2,L)$ is achievable, together with a capacity-achieving condition.

cs.IT↗

Reduced-Feedback Hybrid Precoding for Wideband mmWave MIMO-OFDM Systems via Hierarchical Interpolation

In this paper, we propose a feedback-efficient hybrid precoding framework for wideband millimeter-wave (mmWave) multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) systems. To reduce the hardware cost of radio-frequency (RF) chains and the feedback burden associated with frequency-selective digital precoding, frequency-flat analog precoders and combiners are first constructed from the dominant angle-of-arrival (AoA) and angle-of-departure (AoD) directions associated with the strongest propagation paths. For digital precoding, a shared quantized codebook is designed using the Lloyd algorithm, and a binary-search-based hierarchical interpolation method is developed to identify codeword switching locations between adjacent pilot subcarriers. By avoiding exhaustive codeword comparisons over all intermediate subcarriers, the proposed method reduces online search complexity and enables compact digital-precoder feedback. For the considered system configuration, the proposed method achieves a worst-case feedback reduction of approximately 98.34% relative to full-grid per-subcarrier feedback. Simulation results further demonstrate competitive spectral efficiency and bit error rate (BER) performance, low computational cost, and robustness under imperfect effective channel state information (CSI).

cs.IT↗

SateBeam: Beam-Aware Radio Map Estimation With Physics-Consistent Parametric Modeling for Unknown Multiple Satellites

Dense low-Earth-orbit (LEO) networks increasingly reuse spectrum across moving satellites and overlapping beams, making a spatial radio map essential for interference diagnosis and coordination. Constructing such a map from sparse ground power measurements is difficult because the active satellite subset and its cardinality are unknown, candidate footprints can be highly coherent, and beam pointing, width, effective power, Doppler, and background must be inferred jointly. Known ephemerides do more than enumerate visible candidates. Propagated positions determine candidate-specific ranges, viewing geometry, and spatial footprints, while radial velocities induce distinct time-frequency signatures. Their joint spatial--Doppler structure rejects candidates whose geometry or time--frequency signature conflicts with the observations before continuous beam inference. SateBeam therefore screens all candidates through Doppler-resolved nonnegative fitting. GPU-accelerated grid correlations initialize continuous off-grid refinement; a Gamma-likelihood Bayesian information criterion (BIC) selects model cardinality, and backward deletion and exchange repair greedy support errors. Across paired real-ephemeris scenarios, SateBeam recovers the exact support in every case and reduces independent-query RMSE from $0.655$ to $0.050$ dB relative to orthogonal matching pursuit, with consistent advantages under model mismatch and larger candidate sets. The code is available at https://github.com/UNIC-Lab/SateBeam.

cs.IT↗