[en] Massive MIMO ; power control ; power allocation ; max-min fairness
[en] Power allocation techniques, among which the max-min fairness power allocation (MMFPA) is one of the most widely used, are essential to guarantee good data throughput for all users in a cell. Recently, an efficient MMFPA algorithm for massive multiple-input multiple-output (MIMO) systems has been proposed. However, this algorithm is susceptible to the initial search interval employed by the underlying bisection search. Even if the optimal point belongs to the initial search interval, this algorithm may fail to converge to such a point. In this paper, we use the Perron-Frobenius theory to explain this issue and provide search intervals that guarantee convergence to the optimal point. Furthermore, we propose the bound test procedure as an efficient way of initializing the search interval. Simulation results corroborate our findings.
2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works — authors’ preprint of paper (doi: 10.1109/LCOMM.2020.3014942) published in the IEEE Communications Letters.
[]
