Search

Space‐time adaptive processing (STAP) struggles to effectively suppress clutter in the heterogeneous clutter environment due to the lack of training samples. In order to enhance clutter suppression performance of STAP, a subspace‐weighted mixed‐norm minimisation approach is given. First, a roughly estimated clutter subspace is obtained using the subspace augment (SA) approach. The weight vector is then designed using the association between the dictionary matrix and the noise subspace, allowing the algorithm to penalise sparse coefficients democratically. Finally, in order to solve the subspace‐weighted mixed‐norm minimisation problem, we derive a fast algorithm based on the alternating direction multiplier method (ADMM) framework. The proposed algorithm does not require iteratively updating the weight vector in contrast to the iterative re‐weighted l1 ${l}_{1}$ (IRL1) algorithm. The simulation results demonstrate the effectiveness of the proposed algorithm in terms of computational efficiency and clutter suppression performance. [ABSTRACT FROM AUTHOR]

Space‐time adaptive processing with finite samples is supposed to be a crucial technique for airborne radar systems. Inspired by the application of Gaussian prior in sparse Bayesian learning algorithm and the adaptive least absolute shrinkage and selection operator algorithm, a hierarchical Bayesian framework with adaptive Laplace priors is proposed. In this paper, a novel method is applied to avoid the high‐dimension matrix inverse operation in the proposed algorithm. Moreover, in order to apply the method in the complex‐valued domain, the complex‐valued signal is split into two independent variables. Then, the sparse recovery problem in the complex‐valued domain can be transformed into the real‐value domain. Simulation experiments show that the proposed algorithm can achieve great clutter suppression performance and also ensure high computational efficiency. [ABSTRACT FROM AUTHOR]

Detecting a moving target is an attractive topic in many fields, such as remote sensing. Space-time adaptive processing (STAP) plays a key role in detecting moving targets in strong clutter backgrounds for airborne early warning radar systems. However, STAP suffers serious clutter suppression performance loss when the number of training samples is insufficient due to the inhomogeneous clutter environment. In this article, an efficient sparse recovery STAP algorithm is proposed. First, inspired by the relationship between multiple sparse Bayesian learning (M-SBL) and subspace-based hybrid greedy algorithms, a new optimization objective function based on a subspace penalty is established. Second, the closed-form solution of each minimization step is obtained through the alternating minimization algorithm, which can guarantee the convergence of the algorithm. Finally, a restart strategy is used to adaptively update the support, which reduces the computational complexity. Simulation results show that the proposed algorithm has excellent performance in clutter suppression, convergence speed and running time with insufficient training samples. [ABSTRACT FROM AUTHOR]

The space–time adaptive processing (STAP) technique can effectively suppress the ground clutter faced by the airborne radar during its downward-looking operation and thus can significantly improve the detection performance of moving targets. However, the optimal STAP requires a large number of independent identically distributed (i.i.d) samples to accurately estimate the clutter plus noise covariance matrix (CNCM), which limits its application in practice. In this paper, we fully consider the heterogeneity of clutter in real-world environments and propose a sparse Bayesian learning-based reduced-dimension STAP method that achieves suboptimal clutter suppression performance using only a single sample. First, the sparse Bayesian learning (SBL) algorithm is used to estimate the CNCM using a single training sample. Second, a novel angular Doppler channel selection algorithm is proposed with the criterion of maximizing the output signal-to-clutter-noise ratio (SCNR). Finally, the reduced-dimension STAP filter is constructed using the selected channels. Simulation results show that the proposed algorithm can achieve suboptimal clutter suppression performance in extremely heterogeneous clutter environments where only one training sample can be used. [ABSTRACT FROM AUTHOR]

Space-time adaptive processing (STAP) approaches based on sparse Bayesian learning (SBL) have attracted much attention for the benefit of reducing the training samples requirement and accurately recovering sparse signals. However, it has the problem of a heavy computational burden and slow convergence speed. To improve the convergence speed, the variational Bayesian inference (VBI) is introduced to STAP in this paper. Moreover, to improve computing efficiency, a fast iterative algorithm is derived. By constructing a new atoms selection rule, the dimension of the matrix inverse problem can be substantially reduced. Experiments conducted on the simulated data and measured data verify that the proposed algorithm has excellent clutter suppression and target detection performance. [ABSTRACT FROM AUTHOR]

Non‐sidelooking airborne radar encounters significant non‐stationary and heterogeneous clutter environments, resulting in a severe shortage of samples. Sparse recovery‐based space‐time adaptive processing (SR‐STAP) methods can achieve good clutter suppression performance with limited samples. Nonetheless, grid‐based SR‐STAP algorithms encounter off‐grid effects in non‐sidelooking arrays, which can severely degrade the clutter suppression performance. In this study, the authors propose a novel gridless SR‐STAP method in the continuous spatial‐temporal domain to address the issue of off‐grid effects. Inspired by the fact that sparse Bayesian learning (SBL) framework implicitly performs a structured covariance matrix estimation, the authors reparameterise its cost function to directly estimate the block‐Toeplitz structured matrix from the measurements in a gridless manner. Since the proposed cost function is non‐convex, we utilise a majorisation‐minimisation‐based iterative procedure to estimate the clutter covariance matrix. Finally, using the standard concept of semidefinite programming, the authors derive a convex gridless implementation of the SBL cost function for uniformly sampled radar systems. Extensive simulation experiments demonstrate the exceptional clutter suppression and target detection performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In recent years, sparse recovery-based space-time adaptive processing (SR-STAP) technique has exhibited excellent performance with insufficient samples. Sparse Bayesian learning algorithms have received considerable attention for their remarkable and reliable performance. Its implementation in large-scale radar systems is however hindered by the overwhelming computational load and slow convergence speed. This paper aims to address these drawbacks by proposing an improved iterative reweighted sparse Bayesian learning algorithm based on expansion-compression variance-components (ExCoV-IIR-MSBL). Firstly, a modified Bayesian probabilistic model for SR-STAP is introduced. Exploiting the intrinsic sparsity prior of the clutter, we divide the space-time coefficients into two parts: the significant part with nontrivial coefficients and the irrelevant part with small or zero coefficients. Meanwhile, we only assign independent hyperparameters to the coefficients in the significant part, while the remaining coefficients share a common hyperparameter. Then the generalized maximum likelihood (GML) criterion is adopted to classify the coefficients, ensuring both accuracy and efficiency. Hence, the parameter space in Bayesian inference will be significantly reduced, and the computational efficiency can be considerably promoted. Both theoretical analysis and numerical experiments validate that the proposed algorithm achieves superior performance with considerably improved computational efficiency in sample shortage scenarios. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

• A novel space-time signal model for STAP radar based o n subarray based partly calibrated arrays (PCA) is developed. • The grid-based sparse representation of the signal model for the PCAs is presented. • We proposed a novel SR-STAP algorithm utilizing the low rank and block-sparsity promoting ℓ * , 1 , mixed-norm minimization along with an equivalent compact expression, termed as joint Low Rank and Block Sparse Recovery based STAP (LRBSR-STAP). • We proposed a gridless implementation of our LRBSR formulation for the special case of identical linear subarrays with a common baseline, referred to as GridLess joint Low Rank and Block Sparse Recovery based STAP (GL-LRBSR-STAP). • Extensive numerical experiments are conducted, and the results shows that the proposed algorithms consistently and substantially outperform all the other comparative algorithms with inter-subarray gain-phase and displacement errors under small sample conditions. Sparse recovery based space-time processing (SR-STAP) techniques are capable of achieving satisfactory clutter suppression and target detection performance, even with limited training samples. The majority of existing approaches are developed under the assumption of ideal uniform linear arrays, where no imperfections are present. In this study, we consider the robust STAP problem in the context of airborne partly calibrated array (PCA) composed of several well calibrated subarrays with unknown inter-subarray gain-phase and displacement errors. Initially, the space-time signal for airborne STAP radar based on PCAs is modeled. Subsequently, the authors propose two robust SR-STAP algorithms, considering both grid-based and gridless methods, leveraging the block-sparsity and low rank structural characteristics inherent in the signal model. Extensive numerical experiments have shown the significant performance benefits including small sample applicability and resilience to inter-subarray gain-phase and displacement errors. [ABSTRACT FROM AUTHOR]

Space-time adaptive processing (STAP) is an effective technology in clutter suppression and moving target detection for airborne radar. Because airborne radar moves at a constant acceleration, and there is a lack of independent and identically distributed (IID) training samples caused by the heterogeneous environment, using the conventional STAP methods directly cannot ensure a good performance. To eliminate these effects and improve the performance of clutter suppression, a STAP method based on a sparse Bayesian learning (SBL) framework for uniform acceleration radar is proposed here. This paper introduces the signal model of the uniform acceleration radar. To promote the sparsity, a generalized double Pareto (GDP) prior is introduced into our method, and the estimation of hyper parameters via expectation maximization (EM) is given. The effectiveness of the proposed method is demonstrated by simulations. [ABSTRACT FROM AUTHOR]