Convex Optimization
MIMO Wireless Communications
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
IEEE Transactions on Signal Processing
Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality
IEEE Transactions on Information Theory
On the duality of Gaussian multiple-access and broadcast channels
IEEE Transactions on Information Theory
Sum power iterative water-filling for multi-antenna Gaussian broadcast channels
IEEE Transactions on Information Theory
Sum-capacity computation for the Gaussian vector broadcast channel via dual decomposition
IEEE Transactions on Information Theory
The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel
IEEE Transactions on Information Theory
Correction of Convergence Proof for Iterative Water-Filling in Gaussian MIMO Broadcast Channels
IEEE Transactions on Information Theory
An iterative water-filling algorithm for maximum weighted sum-rate of Gaussian MIMO-BC
IEEE Journal on Selected Areas in Communications
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Hi-index | 0.00 |
In the multi-user multiple input multiple output broadcast channels (MIMO BC), single-antenna mobile users (as receivers) are quite common due to the size and cost limitations of mobile terminals. We simply term this setting as multiple input single output broadcast channels (MISO BC). In the proposed paper, we study the weighted sum-rate optimization problem of the MISO BC. Thus, optimal boundary points of the capacity region can be computed by choosing weighted coefficients. An efficient algorithm faster than the cubic convergence is proposed to efficiently compute the maximum weighted sum-rate for this Gaussian vector broadcast channel. Unlike existing published papers on the weighted sum-rate optimization problem, an available range of the optimal Lagrange multiplier is novelly obtained to guarantee convergence of the proposed algorithm; convergence of the proposed algorithm is proved strictly; and the proposed algorithm also provides fast convergence. In addition, to avoid ineffectively using primal-dual algorithms, as a class of important distributed algorithms, and make them more efficient, a pair of upper and lower bounds, as an interval, to the optimal Lagrange multiplier is proposed. Importance of this point is exploited by the proposed paper, for the first time.