基于序贯凸逼近的MISO下行高效发射波束形成

Oskari Tervo, Le-Nam Tran, M. Juntti
{"title":"基于序贯凸逼近的MISO下行高效发射波束形成","authors":"Oskari Tervo, Le-Nam Tran, M. Juntti","doi":"10.1109/SPAWC.2015.7227071","DOIUrl":null,"url":null,"abstract":"We study the problem of energy efficiency maximization (EEmax) with user-specific quality of service constraints in multiple-input single-output broadcast channels with transmit beamforming. For this challenging nonconvex problem, we propose an efficient approximate design based on sequential convex approximation (SCA). By proper reformulations we arrive at a fast converging iterative algorithm where a convex program is solved at each iteration. We further show that the problem in each iteration can also be approximated as a second-order cone program (SOCP), allowing for exploiting computationally efficient state-of-the-art SOCP solvers. Numerical results show that compared to existing two-layer iterative Dinkelbach based algorithms, the SCA-based method can yield a solution within a few iterations and is insensitive to initial points. We also demonstrate that the superior performance to existing scheme is achieved with lower computational complexity.","PeriodicalId":211324,"journal":{"name":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Energy-efficient transmit beamforming for MISO downlink via sequential convex approximation\",\"authors\":\"Oskari Tervo, Le-Nam Tran, M. Juntti\",\"doi\":\"10.1109/SPAWC.2015.7227071\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the problem of energy efficiency maximization (EEmax) with user-specific quality of service constraints in multiple-input single-output broadcast channels with transmit beamforming. For this challenging nonconvex problem, we propose an efficient approximate design based on sequential convex approximation (SCA). By proper reformulations we arrive at a fast converging iterative algorithm where a convex program is solved at each iteration. We further show that the problem in each iteration can also be approximated as a second-order cone program (SOCP), allowing for exploiting computationally efficient state-of-the-art SOCP solvers. Numerical results show that compared to existing two-layer iterative Dinkelbach based algorithms, the SCA-based method can yield a solution within a few iterations and is insensitive to initial points. We also demonstrate that the superior performance to existing scheme is achieved with lower computational complexity.\",\"PeriodicalId\":211324,\"journal\":{\"name\":\"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-08-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPAWC.2015.7227071\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2015.7227071","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

研究了具有发射波束成形的多输入单输出广播信道中具有用户特定服务质量约束的能效最大化问题。针对这一具有挑战性的非凸问题,我们提出了一种基于顺序凸近似(SCA)的有效近似设计。通过适当的重新表述,我们得到了一种快速收敛的迭代算法,其中每次迭代求解一个凸规划。我们进一步表明,每次迭代中的问题也可以近似为二阶锥规划(SOCP),允许利用计算效率最高的最先进的SOCP求解器。数值结果表明,与现有的基于双层迭代Dinkelbach的算法相比,该方法可以在几次迭代内得到解,并且对初始点不敏感。我们还证明了该方法在较低的计算复杂度下取得了优于现有方案的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Energy-efficient transmit beamforming for MISO downlink via sequential convex approximation
We study the problem of energy efficiency maximization (EEmax) with user-specific quality of service constraints in multiple-input single-output broadcast channels with transmit beamforming. For this challenging nonconvex problem, we propose an efficient approximate design based on sequential convex approximation (SCA). By proper reformulations we arrive at a fast converging iterative algorithm where a convex program is solved at each iteration. We further show that the problem in each iteration can also be approximated as a second-order cone program (SOCP), allowing for exploiting computationally efficient state-of-the-art SOCP solvers. Numerical results show that compared to existing two-layer iterative Dinkelbach based algorithms, the SCA-based method can yield a solution within a few iterations and is insensitive to initial points. We also demonstrate that the superior performance to existing scheme is achieved with lower computational complexity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信