Maximizing Sum Rate and Minimizing MSE on Multiuser Downlink: Optimality, Fast Algorithms and Equivalence via Max-min SINR

被引:86
作者
Tan, Chee Wei [1 ]
Chiang, Mung [2 ]
Srikant, R. [3 ]
机构
[1] City Univ Hong Kong, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China
[2] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
[3] Univ Illinois, Dept Elect & Comp Engn, Urbana, IL 61801 USA
关键词
Beamforming; multiple-input-multiple-output(MIMO); optimization; uplink-downlink duality; wireless communication; POWER-CONTROL; INEQUALITIES; CAPACITY;
D O I
10.1109/TSP.2011.2165065
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Maximizing the minimum weighted signal-to-interference-and-noise ratio (SINR), minimizing the weighted sum mean-square error (MSE) and maximizing the weighted sum rate in a multiuser downlink system are three important performance objectives in nonconvex joint transceiver and power optimization, where all the users have a total power constraint. We show that, through connections with the nonlinear Perron-Frobenius theory, jointly optimizing power and beamformers in the max-min weighted SINR problem can be solved optimally in a distributed fashion. Then, connecting these three performance objectives through the arithmetic-geometric mean inequality and nonnegative matrix theory, we solve the weighted sum MSE minimization and the weighted sum rate maximization in the weak interference regimes using fast algorithms. In the general case, we first establish optimality conditions to the weighted sum MSE minimization and the weighted sum rate maximization problems and provide their further connection to the max-min weighted SINR problem. We then propose a distributed weighted proportional SINR algorithm that leverages our fast max-min weighted SINR algorithm to solve for local optimal solution of the two nonconvex problems, and give conditions under which global optimality is achieved. Numerical results are provided to complement the analysis.
引用
收藏
页码:6127 / 6143
页数:17
相关论文
共 24 条
[1]  
[Anonymous], 1979, NONNEGATIVE MATRICES
[2]  
[Anonymous], 2003, NONLINEAR PROGRAMMIN
[3]   Gradient convergence in gradient methods with errors [J].
Bertsekas, DP ;
Tsitsiklis, JN .
SIAM JOURNAL ON OPTIMIZATION, 2000, 10 (03) :627-642
[4]   An affine eigenvalue problem on the nonnegative orthant [J].
Blondel, VD ;
Ninove, L ;
Van Dooren, P .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2005, 404 :69-84
[5]  
Boyd S., 2004, CONVEX OPTIMIZATION, VFirst, DOI DOI 10.1017/CBO9780511804441
[6]   Randomized gossip algorithms [J].
Boyd, Stephen ;
Ghosh, Arpita ;
Prabhakar, Balaji ;
Shah, Devavrat .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (06) :2508-2530
[7]   Power control by geometric programming [J].
Chiang, Mung ;
Tan, Chee Wei ;
Palomar, Daniel P. ;
O'Neill, Daniel ;
Julian, David .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2007, 6 (07) :2640-2651
[8]   Joint design of tx-rx beamformers in MIMO downlink channel [J].
Codreanu, Marian ;
Toelli, Antti ;
Juntti, Markku ;
Latva-Aho, Matti .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2007, 55 (09) :4639-4655
[9]  
Cover T.M., 2006, ELEMENTS INFORM THEO, V2nd ed
[10]   A SIMPLE DISTRIBUTED AUTONOMOUS POWER-CONTROL ALGORITHM AND ITS CONVERGENCE [J].
FOSCHINI, GJ ;
MILJANIC, Z .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 1993, 42 (04) :641-646