Robust Adaptive Beamforming Via Worst-Case SINR Maximization With Nonconvex Uncertainty Sets

Thumbnail Image

Access rights

openAccess
publishedVersion

URL

Journal Title

Journal ISSN

Volume Title

A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)

Authors

Date

2023-01-27

Department

Department of Information and Communications Engineering

Major/Subject

Mcode

Degree programme

Language

en

Pages

15

Series

IEEE Transactions on Signal Processing, Volume 71, pp. 218-232

Abstract

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.

Description

Publisher Copyright: Author

Keywords

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

Other note

DOI

10.1109/TSP.2023.3240312

Citation

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.3240312

Permanent link to this item

https://urn.fi/URN:NBN:fi:aalto-202303072343

Collections

[article-cris] Sähkötekniikan korkeakoulu / ELEC