Robust adaptive beamforming algorithm based on damped singular value decomposition regularization

• Published in: Digital signal processing 2022-04, Vol.122, p.103356, Article 103356
• Main Authors: Zhang, Xue-Jun, Feng, Da-Zheng, Nie, Wei-Ke, Lin, Shi-Yu, Hu, Hao-Shuang
• Format: Article
• Language: English
• Subjects: L-curve method; Least squares problem; Loading level; Model mismatches; Robust adaptive beamformer
• ISSN: 1051-2004; 1095-4333
• DOI: 10.1016/j.dsp.2021.103356

When adaptive beamformers are applied to actual problems, various model mismatches are present in the sample covariance matrix and signal steering vector, which severely deteriorates the performance of the beamformer. To address this issue, we develop a novel adaptive beamforming algorithm in which the weight vector is a linear combination of the presumed steering vector and basis vectors of the orthogonal supplement subspace of the steering vector. Then, we convert the common constrained optimization problem into an unconstrained one to establish the new beamformer. Moreover, we use damped singular value decomposition regularization, which employs the L-curve method to adaptively determine the regularized factor (loading level), for suppressing the effects of model mismatches. In addition, we perform simulations of the proposed algorithm and other existing beamforming algorithms by considering several commonly encountered mismatches (e.g., the direction-of-arrival mismatch, sensor gain, phase error and location perturbation, coherent local scattering, and mutual coupling) and demonstrate the superior performance of the new beamforming algorithm.