Efficient and Robust Adaptive Beamforming Based on Coprime Array Interpolation

Abstract

Unlike uniform linear arrays (ULAs), coprime arrays require fewer physical sensors yet provide higher degrees of freedom (DOF) and larger array apertures. However, due to the existence of “holes” in the differential co-array, the target detection performance deteriorates, especially in adaptive beamforming. To address these challenges, this paper proposes an efficient and robust adaptive beamforming algorithm leveraging coprime array interpolation. The algorithm eliminates unwanted signals and uses the Gauss–Legendre quadrature method to reconstruct an Interference-plus-Noise Covariance Matrix (INCM), thereby obtaining the beamforming coefficients. Unlike previous techniques, we utilize a virtual interpolated ULA to expand the aperture, enabling the acquisition of a high-dimensional covariance matrix. Additionally, a projection matrix is constructed to eliminate unwanted signals from the received data, greatly enhancing the accuracy of INCM reconstruction. To address the high computational complexity of integral operations used in most INCM reconstruction algorithms, we propose an approximation based on the Gauss–Legendre quadrature, which reduces the computational load while maintaining accuracy. This algorithm avoids the array aperture loss caused by using only the ULA segment in the difference co-array and improves the accuracy of INCM reconstruction. Simulation and experimental results show that the performance of the proposed algorithm is superior to the compared beamformers and is closer to the optimal beamformer in various scenarios.