{"title":"2D Beamforming for 3D Full-Dimensional Massive MIMO","authors":"Wenbo Zhu, H. Tuan, Y. Fang","doi":"10.1109/ICCAIS56082.2022.9990535","DOIUrl":null,"url":null,"abstract":"The paper considers the jointly 2D beamforming design for multi-user (MU) full-dimensional (3D) massive multiple-input multiple output (m-MIMO) systems to maximize the geometric mean of users’ rate (GM-rate), which yields not only users’ fairness in terms of their rate but also rational transmit powers at antennas. We develop a low-complex algorithms, which iterates closed-form expressions for computational solutions of the GM-rate maximization problem. The provided simulations confirm the viability of our development.","PeriodicalId":273404,"journal":{"name":"2022 11th International Conference on Control, Automation and Information Sciences (ICCAIS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 11th International Conference on Control, Automation and Information Sciences (ICCAIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCAIS56082.2022.9990535","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The paper considers the jointly 2D beamforming design for multi-user (MU) full-dimensional (3D) massive multiple-input multiple output (m-MIMO) systems to maximize the geometric mean of users’ rate (GM-rate), which yields not only users’ fairness in terms of their rate but also rational transmit powers at antennas. We develop a low-complex algorithms, which iterates closed-form expressions for computational solutions of the GM-rate maximization problem. The provided simulations confirm the viability of our development.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
