Reduced-complexity transmit power optimization techniques for multiuser MIMO with per-antenna power constraint

Y. Ohwatari, A. Benjebbour, J. Hagiwara, T. Ohya
{"title":"Reduced-complexity transmit power optimization techniques for multiuser MIMO with per-antenna power constraint","authors":"Y. Ohwatari, A. Benjebbour, J. Hagiwara, T. Ohya","doi":"10.1109/ALLERTON.2008.4797532","DOIUrl":null,"url":null,"abstract":"For a multiuser (MU)-MIMO precoded transmission with individual constraints on the maximum power of each transmit antenna, the transmit power optimization problem is a non-linear convex optimization problem with a high level of computational complexity. In this paper, we propose three methods in order to reduce the computational complexity associated with this problem. The reductions in computational complexity achieved with the proposed methods are evaluated under the sum-rate maximization criterion assuming i.i.d Rayleigh fading MIMO channels and block diagonalization zero-forcing as a precoder.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2008.4797532","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

For a multiuser (MU)-MIMO precoded transmission with individual constraints on the maximum power of each transmit antenna, the transmit power optimization problem is a non-linear convex optimization problem with a high level of computational complexity. In this paper, we propose three methods in order to reduce the computational complexity associated with this problem. The reductions in computational complexity achieved with the proposed methods are evaluated under the sum-rate maximization criterion assuming i.i.d Rayleigh fading MIMO channels and block diagonalization zero-forcing as a precoder.
具有单天线功率约束的多用户MIMO低复杂度发射功率优化技术
对于每个发射天线的最大功率都有单独约束的多用户(MU)-MIMO预编码传输,发射功率优化问题是一个计算复杂度很高的非线性凸优化问题。在本文中,我们提出了三种方法来降低与此问题相关的计算复杂度。在假设瑞利衰落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学术文献互助群
群 号:481959085
Book学术官方微信