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

Desmond W. H. Cai, Tony Q. S. Quek, C. Tan
{"title":"Max-min weighted SIR for MIMO downlink system: Optimality and algorithms","authors":"Desmond W. H. Cai, Tony Q. S. Quek, C. Tan","doi":"10.1109/ISIT.2010.5513412","DOIUrl":null,"url":null,"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.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2010.5513412","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

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.
MIMO下行系统的最大-最小加权SIR:最优性和算法
在无线MIMO下行链路系统中,设计能够适应不同用户的发射和接收功率和波束形成的快速算法来优化性能是非常重要的。本文研究了下行链路中最大-最小加权SIR问题,其中多个用户根据优先级进行加权,并受到总功率约束。这种非凸问题的困难是由发射和接收波束形成器中的耦合加剧的,从而使其难以以分布式方式进行优化。我们首先证明,当通道是排名第一时,这个问题可以使用快速算法进行最优和有效的计算。并对最佳发射接收功率和波束形成进行了解析推导。然后,我们利用MIMO上行-下行对偶性来调整我们的算法,以计算具有一般秩的信道的局部最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信