MISO下行链路能量效率最大化的联合发射波束形成和天线选择

Oskari Tervo, Le-Nam Tran, M. Juntti
{"title":"MISO下行链路能量效率最大化的联合发射波束形成和天线选择","authors":"Oskari Tervo, Le-Nam Tran, M. Juntti","doi":"10.1109/GlobalSIP.2014.7032090","DOIUrl":null,"url":null,"abstract":"We study the joint beamforming and antenna selection problem for energy efficiency maximization in multi-user multiple-input single-output (MISO) downlink channel. By viewing antenna selection as finding a sparse solution, we first introduce a sparsity-inducing regularization term to the design problem. Since the resulting problem is nonconvex, it is difficult to find an optimal solution, and we apply a local optimization method based on the concept of sequential convex approximation (SCA) to solve this problem. By proper reformulations we arrive at a fast converging iterative algorithm, where a convex program is solved at each iteration. In the first design, we simply ignore antennas of which the associated beamformers are nearly zero and select the remaining ones. In the second design, we further perform the search over the selected antennas of the first design to improve the energy efficiency. Numerical results demonstrate remarkable performance gains of the proposed approaches in terms of energy efficiency over the solution without antenna selection.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Joint transmit beamforming and antenna selection for energy efficiency maximization in MISO downlink\",\"authors\":\"Oskari Tervo, Le-Nam Tran, M. Juntti\",\"doi\":\"10.1109/GlobalSIP.2014.7032090\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the joint beamforming and antenna selection problem for energy efficiency maximization in multi-user multiple-input single-output (MISO) downlink channel. By viewing antenna selection as finding a sparse solution, we first introduce a sparsity-inducing regularization term to the design problem. Since the resulting problem is nonconvex, it is difficult to find an optimal solution, and we apply a local optimization method based on the concept of sequential convex approximation (SCA) to solve this problem. By proper reformulations we arrive at a fast converging iterative algorithm, where a convex program is solved at each iteration. In the first design, we simply ignore antennas of which the associated beamformers are nearly zero and select the remaining ones. In the second design, we further perform the search over the selected antennas of the first design to improve the energy efficiency. Numerical results demonstrate remarkable performance gains of the proposed approaches in terms of energy efficiency over the solution without antenna selection.\",\"PeriodicalId\":362306,\"journal\":{\"name\":\"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GlobalSIP.2014.7032090\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GlobalSIP.2014.7032090","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

研究了多用户多输入单输出(MISO)下行信道中联合波束形成和天线选择的能量效率最大化问题。通过将天线选择视为寻找稀疏解,我们首先将稀疏性正则化项引入到设计问题中。由于所得到的问题是非凸的,因此很难找到最优解,我们采用了基于顺序凸逼近(SCA)概念的局部优化方法来解决这一问题。通过适当的重新表述,我们得到了一种快速收敛的迭代算法,其中每次迭代求解一个凸规划。在第一种设计中,我们简单地忽略相关波束成率接近于零的天线,并选择剩余的天线。在第二种设计中,我们进一步对第一种设计的选定天线进行搜索,以提高能源效率。数值结果表明,与不选择天线的解决方案相比,所提出的方法在能量效率方面有显著的性能提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Joint transmit beamforming and antenna selection for energy efficiency maximization in MISO downlink
We study the joint beamforming and antenna selection problem for energy efficiency maximization in multi-user multiple-input single-output (MISO) downlink channel. By viewing antenna selection as finding a sparse solution, we first introduce a sparsity-inducing regularization term to the design problem. Since the resulting problem is nonconvex, it is difficult to find an optimal solution, and we apply a local optimization method based on the concept of sequential convex approximation (SCA) to solve this problem. By proper reformulations we arrive at a fast converging iterative algorithm, where a convex program is solved at each iteration. In the first design, we simply ignore antennas of which the associated beamformers are nearly zero and select the remaining ones. In the second design, we further perform the search over the selected antennas of the first design to improve the energy efficiency. Numerical results demonstrate remarkable performance gains of the proposed approaches in terms of energy efficiency over the solution without antenna selection.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信