A Robust Adaptive Beamforming Algorithm based on Subspace Complement

摘要

A novel algorithm for robust adaptive beamforming is put forward in this paper. This algorithm use the characteristic of complement of desired signal subspace complement to build constrained model and solve the supremum, then the solution based on convex programming are given in the paper. The two characteristics of the proposed algorithm are: on one hand, this algorithm does not need imprecise steering vector of desired signal and exact antenna array geometry; on the other hand, the presented algorithm has robustness for steering vector mismatches, antenna element displacement errors and other errors, and has better performance than existing algorithms. The simulation results show the effectiveness of the proposed algorithm. Due to the little prior information is needed; therefore, it is helpful to engineering application.