Max-min weighted SIR for MIMO downlink system: Optimality and algorithms

Desmond W.H. Cai, Tony Q.S. Quek, Chee Wei Tan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

Designing fast algorithms that adapt the transmit and receive power and beamformers to optimize performance for different users is important in wireless MIMO downlink systems. This paper studies the max-min weighted SIR problem in the downlink, where multiple users are weighted according to priority and are subject to a total power constraint. The difficulty of this nonconvex problem is compounded by the coupling in the transmit and receive beamformers, thereby making it hard to optimize in a distributed fashion. We first show that this problem can be optimally and efficiently computed using a fast algorithm when the channels are rank-one. The optimal transmit and receive power and beamformers are also derived analytically. We then exploit the MIMO uplink-downlink duality to adapt our algorithm to compute a local optimal solution for channels with general rank.

Original languageEnglish
Title of host publication2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
Pages2118-2122
Number of pages5
DOIs
Publication statusPublished - 2010
Event2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States
Duration: 2010 Jun 132010 Jun 18

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8103

Conference

Conference2010 IEEE International Symposium on Information Theory, ISIT 2010
Country/TerritoryUnited States
CityAustin, TX
Period10-06-1310-06-18

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Max-min weighted SIR for MIMO downlink system: Optimality and algorithms'. Together they form a unique fingerprint.

Cite this