Open AccessA Low Complexity Robust Adaptive Beamforming Method with Orthogonality Constraint
Author(s) -
BangTun Zhao,
Jia Yang
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1419/1/012012
Subject(s) - orthogonality , beamforming , adaptive beamformer , mathematical optimization , lagrange multiplier , semidefinite programming , computation , computer science , computational complexity theory , constraint (computer aided design) , relaxation (psychology) , algorithm , relaxation technique , mathematics , telecommunications , medicine , social psychology , psychology , geometry , alternative medicine , pathology
Performance of many adaptive beamforming methods degrades when antenna array steering vector mismatch exists and popular optimization-based methods suffer from heavy computation complexity. In this paper, we investigate robust adaptive beamforming technique with low complexity. An optimization problem is constructed based on orthogonality constraint instead of conventional norm constraint; therefore, semidefinite programming (SDP) relaxation is avoided. We present the approach to obtain closed-form solution by imposing Lagrange multiplier methodology. Numerical experiments demonstrate that proposed low complexity method outperforms other previously developed beamforming methods and reduces computation time significantly.