Quality-of-Service Constrained User and Antenna Selection in Downlink Massive-MIMO Systems

J. Akhtar, K. Rajawat
{"title":"Quality-of-Service Constrained User and Antenna Selection in Downlink Massive-MIMO Systems","authors":"J. Akhtar, K. Rajawat","doi":"10.1109/WCNCW.2019.8902647","DOIUrl":null,"url":null,"abstract":"This paper considers a maximum-ratio transmitter (MRT) based-downlink transmission in a multi-user massive-MIMO system under the small-scale fading. The base-station is cost-constrained and can therefore afford only a limited number of RF chains. Likewise, the users have strict quality of service constraints (QoS) and therefore not all users can be served within the specified power budget. Specifically, such problems are combinatorial in nature and so an optimal solution can be obtained by running an exhaustive search over all possible set of antenna and user pairs that meet the QoS and simultaneously achieves the best rate. However, implementing the exhaustive search method is not viable for all practical applications due to the large size and consequently the intractable computational costs involved. Thus, a low complexity based joint antenna and user selection problem is formulated and solved using convex relaxation. Different from the existing techniques that rely on greedy approaches, the proposed algorithm yields near-optimal sum-rates and can be readily applied to very large systems. Detailed simulation results are presented to corroborate the near-optimality of the proposed scheme.","PeriodicalId":121352,"journal":{"name":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNCW.2019.8902647","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper considers a maximum-ratio transmitter (MRT) based-downlink transmission in a multi-user massive-MIMO system under the small-scale fading. The base-station is cost-constrained and can therefore afford only a limited number of RF chains. Likewise, the users have strict quality of service constraints (QoS) and therefore not all users can be served within the specified power budget. Specifically, such problems are combinatorial in nature and so an optimal solution can be obtained by running an exhaustive search over all possible set of antenna and user pairs that meet the QoS and simultaneously achieves the best rate. However, implementing the exhaustive search method is not viable for all practical applications due to the large size and consequently the intractable computational costs involved. Thus, a low complexity based joint antenna and user selection problem is formulated and solved using convex relaxation. Different from the existing techniques that rely on greedy approaches, the proposed algorithm yields near-optimal sum-rates and can be readily applied to very large systems. Detailed simulation results are presented to corroborate the near-optimality of the proposed scheme.
下行链路大规模mimo系统中服务质量约束的用户和天线选择
研究了基于最大比发射机(MRT)的多用户大规模mimo系统在小尺度衰落下的下行传输问题。基站成本有限,因此只能负担有限数量的射频链。同样,用户有严格的服务质量约束(QoS),因此在指定的功率预算内不能为所有用户提供服务。具体来说,这些问题本质上是组合的,因此可以通过对满足QoS并同时达到最佳速率的所有可能的天线和用户对集进行穷举搜索来获得最优解。然而,穷举搜索方法的实现并不适用于所有的实际应用,因为它的计算量大,计算成本高。因此,提出了一种基于低复杂度的联合天线和用户选择问题,并利用凸松弛进行求解。与现有依赖贪婪方法的技术不同,所提出的算法产生接近最优的和速率,并且可以很容易地应用于非常大的系统。详细的仿真结果证实了所提方案的近似最优性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信