Kun Liu

The traditional sparse recovery (SR) space-time adaptive processing (STAP) algorithms are greatly affected by grid mismatch, leading to poor performance in airborne bistatic radar clutter suppression. In order to address this issue, this paper proposes an SR STAP algorithm for airborne bistatic radars based on atomic selection under the Bayesian framework. This method adopts the idea of atomic selection for the process of Bayesian inference, continuously evaluating the contribution of atoms to the likelihood function to add or remove atoms, and then using the selected atoms to estimate the clutter support subspace and perform sparse recovery in the clutter support subspace. Due to the inherent sparsity of clutter signals, performing sparse recovery in the clutter support subspace avoids using a massive number of atoms from an overcomplete space-time dictionary, thereby greatly improving computational efficiency. In airborne bistatic radar scenarios where significant grid mismatch exists, this method can mitigate the performance degradation caused by grid mismatch by encrypting grid points. Since the sparse recovery is performed in the clutter support subspace, encrypting grid points does not lead to excessive computational burden. Additionally, this method integrates out the noise term under a new hierarchical Bayesian model, preventing the adverse effects caused by inaccurate noise power estimation during iterations in the traditional SR STAP algorithms, further enhancing its performance. Our simulation results demonstrate the high efficiency and superior clutter suppression performance and target detection performance of this method.

Space–time adaptive processing (STAP) based on sparse recovery achieves excellent clutter suppression and target detection performance, even with a limited number of available training samples. However, most of these methods face performance degradation due to grid mismatch, which impedes their application in bistatic clutter suppression. Some gridless methods, such as atomic norm minimization (ANM), can effectively address grid mismatch issues, yet they are sensitive to parameter settings and array errors. In this article, the authors propose a data and model-driven algorithm that unfolds the iterative process of atomic norm minimization into a deep network. This approach establishes a concrete and systematic link between iterative algorithms, extensively utilized in signal processing, and deep neural networks. This methodology not only addresses the challenges associated with parameter settings in traditional optimization algorithms, but also mitigates the lack of interpretability issues commonly found in deep neural networks. Moreover, due to more rational parameter settings, the proposed algorithm achieves effective clutter suppression with fewer iterations, thereby reducing computational time. Finally, extensive simulation experiments demonstrate the effectiveness of the proposed algorithm in clutter suppression for airborne bistatic radar.

Sparse Bayesian learning-based space–time adaptive processing (SBL-STAP) algorithms can achieve superior clutter suppression performance with limited training sample support in practical heterogeneous and non-stationary clutter environments. However, when the system has high degrees of freedom (DOFs), SBL-STAP algorithms suffer from high computational complexity, since the large-scale matrix calculations and the inversion operations of large-scale covariance matrices are involved in the iterative process. In this article, we consider a computationally efficient implementation for SBL-STAP algorithms. The efficient implementation is based on the fact that the covariance matrices that need to be updated in the iterative process of the SBL-STAP algorithms have a Hermitian Toplitz-block-Toeplitz (HTBT) structure, with the result being that the inverse covariance matrix can be expressed in closed form by using a special case of the Gohberg–Semencul (G-S) formula. Based on the G-S-type factorization of the inverse covariance matrix and the structure of the used dictionary matrix, we can perform almost all operations in the SBL-STAP algorithms by 2-D FFT/IFFT. As a result, compared with the original SBL-STAP algorithms, even for moderate data sizes, the proposed algorithms can directly reduce the computational load by about two orders of magnitudes without any performance loss. Finally, simulation results validate the effectiveness of the proposed algorithms.

Space-time adaptive processing (STAP) algorithms based on sparse recovery (SR) have been researched because of their low requirement of training snapshots. However, once some portion of clutter is not located on the grids, i.e., off-grid problems, the performances of most SR-STAP algorithms degrade significantly. Reducing the grid interval can mitigate off-grid effects, but brings strong column coherence of the dictionary, heavy computational load, and heavy storage load. A sparse Bayesian learning approach is proposed to mitigate the off-grid effects in the paper. The algorithm employs an efficient sequential addition and deletion of dictionary atoms to estimate the clutter subspace, which means that strong column coherence has no effect on the performance of the proposed algorithm. Besides, the proposed algorithm does not require much computational load and storage load. Off-grid effects can be mitigated with the proposed algorithm when the grid-interval is sufficiently small. The excellent performance of the novel algorithm is demonstrated on the simulated data.

Space-time adaptive processing (STAP) encounters severe performance degradation with insufficient training samples in inhomogeneous environments. Sparse Bayesian learning (SBL) algorithms have attracted extensive attention because of their robust and self-regularizing nature. In this study, a computationally efficient SBL STAP algorithm with adaptive Laplace prior is developed. Firstly, a hierarchical Bayesian model with adaptive Laplace prior for complex-value space-time snapshots (CALM-SBL) is formulated. Laplace prior enforces the sparsity more heavily than Gaussian, which achieves a better reconstruction of the clutter plus noise covariance matrix (CNCM). However, similar to other SBL-based algorithms, a large degree of freedom will bring a heavy burden to the real-time processing system. To overcome this drawback, an efficient localized reduced-dimension sparse recovery-based space-time adaptive processing (LRDSR-STAP) framework is proposed in this paper. By using a set of deeply weighted Doppler filters and exploiting prior knowledge of the clutter ridge, a novel localized reduced-dimension dictionary is constructed, and the computational load can be considerably reduced. Numerical experiments validate that the proposed method achieves better performance with significantly reduced computational complexity in limited snapshots scenarios. It can be found that the proposed LRDSR-CALM-STAP algorithm has the potential to be implemented in practical real-time processing systems.

In the presence of unknown array errors, sparse recovery based space-time adaptive processing (SR-STAP) methods usually directly use the ideal spatial steering vectors without array errors to construct the space-time dictionary; thus, the steering vector mismatch between the dictionary and clutter data will cause a severe performance degradation of SR-STAP methods. To solve this problem, in this paper, we propose a two-stage SR-STAP method for suppressing nonhomogeneous clutter in the presence of arbitrary array errors. In the first stage, utilizing the spatial-temporal coupling property of the ground clutter, a set of spatial steering vectors with array errors are well estimated by fine Doppler localization. In the second stage, firstly, in order to solve the model mismatch problem caused by array errors, we directly use these spatial steering vectors obtained in the first stage to construct the space-time dictionary, and then, the constructed dictionary and multiple measurement vectors sparse Bayesian learning (MSBL) algorithm are combined for space-time adaptive processing (STAP). The proposed SR-STAP method can exhibit superior clutter suppression performance and target detection performance in the presence of arbitrary array errors. Simulation results validate the effectiveness of the proposed method.