SINR Maximizing Distributionally Robust Adaptive Beamforming

• Published in: IEEE transactions on signal processing Vol. 73; pp. 2542 - 2557
• Main Authors: Irani, Kiarash Hassas, Huang, Yongwei, Vorobyov, Sergiy A.
• Format: Journal Article
• Language: English
• Published: New York IEEE 2025; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Array signal processing; Beamforming; Constraints; Covariance matrices; distributionally robust optimization; Expected values; Interference; interference-plus-noise covariance (INC) matrix; Iterative algorithms; Linear matrix inequalities; Maximization; Optimization; Programming; quadratic matrix inequality; rank-one solutions; Robust adaptive beamforming (RAB); Robustness; Signal to noise ratio; strong duality; Symbols; Uncertainty; Vectors
• ISSN: 1053-587X; 1941-0476
• DOI: 10.1109/TSP.2025.3582396

This paper addresses the robust adaptive beamforming (RAB) problem via the worst-case signal-to-interference-plus-noise ratio (SINR) maximization over distributional uncertainty sets for the random interference-plus-noise covariance (INC) matrix and desired signal steering vector. Our study explores two distinct uncertainty sets for the INC matrix and three for the steering vector. The uncertainty sets of the INC matrix account for the support and the positive semidefinite (PSD) mean of the distribution, as well as a similarity constraint on the mean. The uncertainty sets for the steering vector consist of the constraints on the first- and second-order moments of its associated probability distribution. The RAB problem is formulated as the minimization of the worst-case expected value of the SINR denominator over any distribution within the uncertainty set of the INC matrix, subject to the condition that the expected value of the numerator is greater than or equal to one for every distribution within the uncertainty set of the steering vector. By leveraging the strong duality of linear conic programming, this RAB problem is reformulated as a quadratic matrix inequality problem. Subsequently, it is addressed by iteratively solving a sequence of linear matrix inequality relaxation problems, incorporating a penalty term for the rank-one PSD matrix constraint. We further analyze the convergence of the iterative algorithm. The proposed robust beamforming approach is validated through simulation examples, which illustrate improved performance in terms of the array output SINR.