Robust Beamforming with Magnitude Response Constraints Using Alternating Minimization

L. Gao, Bin Gao
{"title":"Robust Beamforming with Magnitude Response Constraints Using Alternating Minimization","authors":"L. Gao, Bin Gao","doi":"10.1109/ICEICT.2019.8846418","DOIUrl":null,"url":null,"abstract":"We consider the robust beamforming problem with magnitude response constraints to deal with direction-of-arrival (DOA) mismatch in this paper. Because of the non-convex constraints, the traditional convex optimization methods cannot be applied directly. Although semidefinite relaxation (SDR) has been widely applied to tackle non-convex problems, its performance cannot be guaranteed in certain situations. Towards this end, an Alternating Minimization Algorithm (AMA) is proposed. Specifically, the rank-one constraint is first transformed into a trace inequality. Then, this new function is solved by using the proposed alternating optimization method, which converges to the locally optimum rank-one solution. It is verified by simulation results that the proposed beamformer has better robustness.","PeriodicalId":382686,"journal":{"name":"2019 IEEE 2nd International Conference on Electronic Information and Communication Technology (ICEICT)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 2nd International Conference on Electronic Information and Communication Technology (ICEICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEICT.2019.8846418","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We consider the robust beamforming problem with magnitude response constraints to deal with direction-of-arrival (DOA) mismatch in this paper. Because of the non-convex constraints, the traditional convex optimization methods cannot be applied directly. Although semidefinite relaxation (SDR) has been widely applied to tackle non-convex problems, its performance cannot be guaranteed in certain situations. Towards this end, an Alternating Minimization Algorithm (AMA) is proposed. Specifically, the rank-one constraint is first transformed into a trace inequality. Then, this new function is solved by using the proposed alternating optimization method, which converges to the locally optimum rank-one solution. It is verified by simulation results that the proposed beamformer has better robustness.
基于交替最小化的幅度响应约束鲁棒波束形成
本文考虑了具有幅度响应约束的鲁棒波束形成问题来处理DOA不匹配问题。由于非凸约束,传统的凸优化方法不能直接应用。虽然半定松弛(SDR)已被广泛应用于求解非凸问题,但在某些情况下其性能并不能得到保证。为此,提出了交替最小化算法(AMA)。具体地说,首先将排名第一的约束转化为迹不等式。然后,利用交替优化方法求解该新函数,该方法收敛于局部最优秩一解。仿真结果表明,该波束形成器具有较好的鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信