Energy Efficiency Maximization in Massive MIMO-aided, Fronthaul-constrained C-RAN

Jobin Francis, G. Fettweis
{"title":"Energy Efficiency Maximization in Massive MIMO-aided, Fronthaul-constrained C-RAN","authors":"Jobin Francis, G. Fettweis","doi":"10.1109/PIMRC.2019.8904159","DOIUrl":null,"url":null,"abstract":"Cloud radio access network (C-RAN) and massive multiple-input-multiple-output (MIMO) are two key enabling technologies for 5G as they improve radio performance while lowering the cost of operation. In a C-RAN system with massive MIMO-based remote radio units (RRUs), fronthaul is often the bottleneck in practice due to its finite capacity. To reduce the capacity requirements on fronthaul, precoding is done at the RRUs. In this paper, we maximize the energy efficiency (EE) of such a system by optimizing the transmit powers while explicitly incorporating the capacity constraints on fronthaul. We develop a successive convex approximation (SCA) algorithm, which is guaranteed to converge to a local optimum. Towards this, we propose novel bounds on the user rate function, which facilitates a convex approximation of the EE maximization problem. The convex problem is solved in each SCA iteration through Dinkel-bach’s algorithm and dual decomposition. Numerical results show that the proposed algorithm significantly improves EE compared to the case with no power control and outperforms the weighted minimum mean square error algorithm.","PeriodicalId":412182,"journal":{"name":"2019 IEEE 30th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 30th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.2019.8904159","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Cloud radio access network (C-RAN) and massive multiple-input-multiple-output (MIMO) are two key enabling technologies for 5G as they improve radio performance while lowering the cost of operation. In a C-RAN system with massive MIMO-based remote radio units (RRUs), fronthaul is often the bottleneck in practice due to its finite capacity. To reduce the capacity requirements on fronthaul, precoding is done at the RRUs. In this paper, we maximize the energy efficiency (EE) of such a system by optimizing the transmit powers while explicitly incorporating the capacity constraints on fronthaul. We develop a successive convex approximation (SCA) algorithm, which is guaranteed to converge to a local optimum. Towards this, we propose novel bounds on the user rate function, which facilitates a convex approximation of the EE maximization problem. The convex problem is solved in each SCA iteration through Dinkel-bach’s algorithm and dual decomposition. Numerical results show that the proposed algorithm significantly improves EE compared to the case with no power control and outperforms the weighted minimum mean square error algorithm.
大规模mimo辅助、前端约束C-RAN的能效最大化
云无线接入网(C-RAN)和大规模多输入多输出(MIMO)是5G的两项关键使能技术,因为它们可以提高无线电性能,同时降低运营成本。在具有大量mimo远程无线电单元(rru)的C-RAN系统中,由于容量有限,前传往往成为实际应用中的瓶颈。为了减少前传的容量需求,在rru上进行预编码。在本文中,我们通过优化发射功率来最大化这种系统的能量效率,同时明确地将前传的容量约束纳入其中。提出了一种保证收敛到局部最优的连续凸逼近(SCA)算法。为此,我们提出了用户速率函数的新边界,这有助于EE最大化问题的凸逼近。通过丁克尔-巴赫算法和对偶分解在每次SCA迭代中求解凸问题。数值结果表明,与无功率控制情况相比,该算法显著提高了EE,优于加权最小均方误差算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信