z-logo
open-access-imgOpen Access
Robust adaptive beamforming based on semi-definite programming and rank-one decomposition
Author(s) -
Yan Wang,
Wenfeng Wu,
Zhan Fan,
Guolong Liang
Publication year - 2013
Publication title -
wuli xuebao
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.199
H-Index - 47
ISSN - 1000-3290
DOI - 10.7498/aps.62.184302
Subject(s) - adaptive beamformer , capon , robustness (evolution) , computer science , beamforming , rank (graph theory) , algorithm , mathematical optimization , noise (video) , mathematics , telecommunications , artificial intelligence , biochemistry , chemistry , combinatorics , image (mathematics) , gene
The performance of Capon beamformer degrades sharply in the presence of array steering vector mismatch. To solve this problem, a robust beamforming algorithm based on semi-definite programming and rank-one decomposition is proposed, which improves the robustness of the adaptive beamforming by estimating an actual steering vector. The constraints for estimating the steering vector are deduced under the requirement that the estimate does not weaken the ability to suppress interference and noise, and the analysis shows that the approach to formulating constraint using matrix pre-filter is reasonable. The optimization problem is constructed and converted into a semi-definite relaxation problem, and rank-one decomposition technique is adopted in order to obtain the optimal solution. The simulation results demonstrate that compared with the existing algorithms, the proposed algorithm offers high SINR (signal to interference plus noise power ratio) and accuracy of power estimation, with the sole prior information about the angular vector in which the actual signal lies.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here