دورية أكاديمية
Robust Adaptive Beamforming Via Worst-Case SINR Maximization With Nonconvex Uncertainty Sets
| العنوان: | Robust Adaptive Beamforming Via Worst-Case SINR Maximization With Nonconvex Uncertainty Sets |
|---|---|
| المؤلفون: | Huang, Yongwei, Fu, Hao, Vorobyov, Sergiy A., Luo, Zhi Quan |
| المساهمون: | Guangdong University of Technology, Huawei Technologies Co., Ltd., Sergiy Vorobyov Group, The Chinese University of Hong Kong, Department of Information and Communications Engineering, Aalto-yliopisto, Aalto University |
| بيانات النشر: | IEEE |
| سنة النشر: | 2023 |
| المجموعة: | Aalto University Publication Archive (Aaltodoc) / Aalto-yliopiston julkaisuarkistoa |
| مصطلحات موضوعية: | Array signal processing, bilinear matrix inequality relaxation, Covariance matrices, Interference, Linear matrix inequalities, nonconvex uncertainty set, Optimization, quadratic matrix inequality, robust adaptive beamforming, Signal to noise ratio, Uncertainty, Worst-case SINR maximization |
| الوصف: | Publisher Copyright: Author ; This paper considers a formulation of the robust adaptive beamforming (RAB) problem based on worst-case signal-to-interference-plus-noise ratio (SINR) maximization with a nonconvex uncertainty set for the steering vectors. The uncertainty set consists of a similarity constraint and a (nonconvex) double-sided ball constraint. The worst-case SINR maximization problem is turned into a quadratic matrix inequality (QMI) problem using the strong duality of semidefinite programming. Then a linear matrix inequality (LMI) relaxation for the QMI problem is proposed, with an additional valid linear constraint. Necessary and sufficient conditions for the tightened LMI relaxation problem to have a rank-one solution are established. When the tightened LMI relaxation problem still has a high-rank solution, the LMI relaxation problem is further restricted to become a bilinear matrix inequality (BLMI) problem. We then propose an iterative algorithm to solve the BLMI problem that finds an optimal/suboptimal solution for the original RAB problem by solving the BLMI formulations. To validate our results, simulation examples are presented to demonstrate the improved array output SINR of the proposed robust beamformer. ; Peer reviewed |
| نوع الوثيقة: | article in journal/newspaper |
| وصف الملف: | 1-14; application/pdf |
| اللغة: | English |
| تدمد: | 1053-587X |
| العلاقة: | IEEE Transactions on Signal Processing; Volume 71; Huang , Y , Fu , H , Vorobyov , S A & Luo , Z Q 2023 , ' Robust Adaptive Beamforming Via Worst-Case SINR Maximization With Nonconvex Uncertainty Sets ' , IEEE Transactions on Signal Processing , vol. 71 , pp. 218-232 . https://doi.org/10.1109/TSP.2023.3240312Test; PURE UUID: d2d5aa64-7063-4a5b-a3e4-4eb1cfee51e0; PURE ITEMURL: https://research.aalto.fi/en/publications/d2d5aa64-7063-4a5b-a3e4-4eb1cfee51e0Test; PURE LINK: http://www.scopus.com/inward/record.url?scp=85148455421&partnerID=8YFLogxKTest; PURE FILEURL: https://research.aalto.fi/files/102374407/Robust_Adaptive_Beamforming_via_Worst_Case_SINR_Maximization_With_Nonconvex_Uncertainty_Sets.pdfTest; https://aaltodoc.aalto.fi/handle/123456789/120015Test; URN:NBN:fi:aalto-202303072343 |
| DOI: | 10.1109/TSP.2023.3240312 |
| الإتاحة: | https://doi.org/10.1109/TSP.2023.3240312Test https://aaltodoc.aalto.fi/handle/123456789/120015Test |
| حقوق: | openAccess |
| رقم الانضمام: | edsbas.691EC620 |
| قاعدة البيانات: | BASE |
| تدمد: | 1053587X |
|---|---|
| DOI: | 10.1109/TSP.2023.3240312 |