Utility Maximization for Large-Scale Cell-Free Massive MIMO Downlink
We consider the system-wide utility maximization problem in the downlink of a cell-free massive multiple-input multiple-output (MIMO) system whereby a very large number of access points (APs) simultaneously serve a group of users. Specifically, four fundamental problems with increasing order of user fairness are of interest: (i) to maximize the average spectral efficiency (SE), (ii) to maximize the proportional fairness, (iii) to maximize the harmonic-rate of all users, and lastly (iv) to maximize the minimum SE of all users, subject to a sum power constraint at each AP. As the considered problems are non-convex, existing solutions normally rely on successive convex approximation to find a sub-optimal solution. More specifically, these known methods use off-the-shelf convex solvers, which basically implement an interior-point algorithm, to solve the derived convex problems. The main issue of such methods is that their complexity does not scale favorably with the problem size, limiting previous studies to cell-free massive MIMO of moderate scales. Thus the potential of cell-free massive MIMO has not been fully understood. To address this issue, we propose a unified framework based on an accelerated projected gradient method to solve the considered problems. Particularly, the proposed solution is found in closed-form expressions and only requires the first order oracle of the objective, rather than the Hessian matrix as in known solutions, and thus is much more memory efficient. Numerical results demonstrate that our proposed solution achieves the same utility performance but with far less run-time, compared to other second-order methods. Simulation results for large-scale cell-free massive MIMO show that the four utility functions can deliver nearly uniformed services to all users. In other words, user fairness is not a great concern in large-scale cell-free massive MIMO.
Code (0)
등록된 구현이 없습니다.
Tasks
FairnessSecond-order methodsSimilar Papers 제목 키워드 기반
Approximate Expected Utility Rationalization
We propose a new measure of deviations from expected utility theory. For any positive number~$e$, we give a characterization of the datasets with a rationalization that is within~$e$ (in beliefs, utility, or perceived pr…
Active inference, Bayesian optimal design, and expected utility
Active inference, a corollary of the free energy principle, is a formal way of describing the behavior of certain kinds of random dynamical systems that have the appearance of sentience. In this chapter, we describe how …
Joint Optimization of Switching Point and Power Control in Dynamic TDD Cell-Free Massive MIMO
We consider a cell-free massive multiple-input multiple-output (CFmMIMO) network operating in dynamic time division duplex (DTDD). The switching point between the uplink (UL) and downlink (DL) data transmission phases ca…
Get Confused Cautiously: Textual Sequence Memorization Erasure with Selective Entropy Maximization
Large Language Models (LLMs) have been found to memorize and recite some of the textual sequences from their training set verbatim, raising broad concerns about privacy and copyright issues when using LLMs. This Textual …
MemorizationText GenerationTRM-UAP: Enhancing the Transferability of Data-Free Universal Adversarial Perturbation via Truncated Ratio Maximization
Aiming at crafting a single universal adversarial perturbation (UAP) to fool CNN models for various data samples, universal attack enables a more efficient and accurate evaluation for the robustness of CNN models. Ea…