The dominant mode rejection algorithm based on rapid subspace decomposition

The dominant mode rejection (DMR) beamformer is widely used in array signal processing because of its good ability to detect weak targets, few snapshots needed, and fast convergence speed. The computation of the DMR algorithm mainly lies in the feature decomposition of the covariance matrix of the data. As the number of elements increases, the computational complexity will increase sharply. In addition, the setting of dimension parameters for the dominant mode subspace can also affect the performance of the algorithm. Based on the Krylov subspace and utilizing the Lanczos type iteration and random approximation, the fast decomposition of the main mode subspace can be achieved to address the issues of increased computational complexity. At the same time, the dimension of the main mode space can be estimated and verified during the Lanczos recursion process. The proposed method significantly reduces the computational complexity of the algorithm, while also accurately estimates the dimensionality of the main mode space. The effectiveness of the proposed algorithm is verified by simulation and experimental data analysis in this paper.