Dual Link Algorithm for the Weighted Sum Rate Maximization in MIMO Interference Channels

MIMO interference network optimization is important for increasingly crowded wireless communication networks. We provide a new algorithm, named Dual Link algorithm, for the classic problem of weighted sum-rate maximization for MIMO multiaccess channels (MAC), broadcast channels (BC), and general MIMO interference channels with Gaussian input and a total power constraint. For MIMO MAC/BC, the algorithm finds optimal signals to achieve the capacity region boundary. For interference channels with Gaussian input assumption, two of the previous state-of-the-art algorithms are the WMMSE algorithm and the polite water-filling (PWF) algorithm. The WMMSE algorithm is provably convergent, while the PWF algorithm takes the advantage of the optimal transmit signal structure and converges the fastest in most situations but is not guaranteed to converge in all situations. It is highly desirable to design an algorithm that has the advantages of both algorithms. The dual link algorithm is such an algorithm. Its fast and guaranteed convergence is important to distributed implementation and time varying channels. In addition, the technique and a scaling invariance property used in the convergence proof may find applications in other non-convex problems in communication networks.

[1]  Giuseppe Caire,et al.  Multiuser MISO Transmitter Optimization for Intercell Interference Mitigation , 2009, IEEE Transactions on Signal Processing.

[2]  H. Vincent Poor,et al.  On Gaussian MIMO BC-MAC duality with multiple transmit covariance constraints , 2008, 2009 IEEE International Symposium on Information Theory.

[3]  Wei Yu,et al.  Uplink-downlink duality via minimax duality , 2006, IEEE Transactions on Information Theory.

[4]  Georgios B. Giannakis,et al.  Optimal resource allocation for MIMO ad hoc cognitive radio networks , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[5]  Ying-Chang Liang,et al.  Weighted sum rate optimization for cognitive radio MIMO broadcast channels , 2009, IEEE Transactions on Wireless Communications.

[6]  A. Goldsmith,et al.  Sum power iterative water-filling for multi-antenna Gaussian broadcast channels , 2002, Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002..

[7]  Lijun Chen,et al.  The Weighted Sum Rate Maximization in MIMO Interference Networks: The Minimax Lagrangian Duality and Algorithm , 2013, ArXiv.

[8]  An Liu,et al.  MIMO B-MAC Interference Network Optimization Under Rate Constraints by Polite Water-Filling and Duality , 2010, IEEE Transactions on Signal Processing.

[9]  An Liu,et al.  Duality, Polite Water-filling, and Optimization for MIMO B-MAC Interference Networks and iTree Networks , 2010, ArXiv.

[10]  Michael L. Honig,et al.  Monotonic convergence of distributed interference pricing in wireless networks , 2009, 2009 IEEE International Symposium on Information Theory.

[11]  Lijun Chen,et al.  Convex-concave procedure for weighted sum-rate maximization in a MIMO interference network , 2014, 2014 IEEE Global Communications Conference.

[12]  Wei Yu Multiuser Water-filling in the Presence of Crosstalk , 2007, 2007 Information Theory and Applications Workshop.

[13]  Wei Yu,et al.  Iterative water-filling for Gaussian vector multiple-access channels , 2001, IEEE Transactions on Information Theory.

[14]  Zhi-Quan Luo,et al.  An iteratively weighted MMSE approach to distributed sum-utility maximization for a MIMO interfering broadcast channel , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[15]  Wei Yu,et al.  Sum-capacity computation for the Gaussian vector broadcast channel via dual decomposition , 2006, IEEE Transactions on Information Theory.

[16]  An Liu,et al.  Polite Water-Filling for Weighted Sum-Rate Maximization in MIMO B-MAC Networks Under Multiple Linear Constraints , 2011, IEEE Transactions on Signal Processing.

[17]  Giuseppe Caire,et al.  MIMO broadcast channel optimization under general linear constraints , 2009, 2009 IEEE International Symposium on Information Theory.

[18]  Virginia Vassilevska Williams,et al.  Multiplying matrices faster than coppersmith-winograd , 2012, STOC '12.

[19]  Syed Ali Jafar,et al.  Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel , 2008, IEEE Transactions on Information Theory.