Space-time Adaptive Processing Research Articles

Clutter-Sensing-Driven Space-Time Adaptive Processing Approach for Airborne Sub-Array-Level Digital Array

Sub-array-level digital arrays effectively diminish the computational complexity and sample demand of space-time adaptive processing (STAP), thus finding extensive applications in many airborne platforms. Nonetheless, airborne sub-array-level digital array radar still encounters pronounced performance deterioration in highly heterogeneous clutter environments due to inadequate training samples. To address this issue, a clutter-sensing-driven STAP approach for airborne sub-array-level digital arrays is proposed in this paper. Firstly, we derive a signal model of sub-array-level clutter sensing in detail and then further analyze the influence of the sidelobe characteristics of the conventional sub-array joint beam on clutter sensing. Secondly, a sub-array joint beam optimization model is proposed, which optimizes the sub-array joint beam into a wide beam with flat-top characteristics to improve the clutter-sensing performance in the beam sidelobe region. Finally, we decompose the complex optimization problem into two subproblems and then relax them into the low sidelobe-shaped beam pattern synthesisproblem and second-order cone programming problem, which can be effectively solved. The effectiveness of the proposed approach is validated in a real clutter environment through numerical experiments.

Reduced-dimension STAP method for conformal array based on sequential convex programming

Compared with the uniform arrays, the conformal array can effectively reduce the radar cross section and improve the utilization of the limited space in the aircraft. However, the special array structure aggravates the non-stationarity of the clutter, and the typical blocking matrix construction method in the space–time adaptive processing (STAP) is not appropriate any more. To address these issues, a reduced dimension STAP algorithm based on penalty sequential convex programming in the generalized sidelobe cancellation structure is proposed. The blocking matrix, channel selection vector and STAP weights can be optimized simultaneously in the algorithm framework. To tackle the resultant nonconvex problem, we formulate the original optimization function as a quasi-convex form and solve these parameters alternately within an iterative framework. Numerical simulations are provided to validate the proposed method and demonstrate its high performance.

Isolated point clutter suppression method for airborne STAP radar in wind farm environment

With the large-scale construction of wind farms, wind turbine isolated point clutter has an increasingly serious impact on airborne radar target detection performance. Traditional space-time adaptive processing methods cannot suppress wind turbine clutter (WTC) with spectrum broadening characteristics, which may lead to a decrease in target detection probability and an increase in false alarm rate. In this paper, a WTC suppression method for airborne radar based on micro-Doppler features is proposed, and we construct the feature subspace of wind turbine echo to distinguish wind turbine, target, clutter, and noise. First, the Sobel operator is used to process the radar range-Doppler spectrum, and the range cells of the wind turbines are preliminarily judged. Then the smallest of constant false alarm rate (SOCFAR) method is used to further confirm the range cells where the wind turbines are located. Next, Mahalanobis distance is used to estimate the optimal dictionary atomic parameters of WTC, and the updated dictionary atoms are used to construct an orthogonal projection matrix to suppress WTC. Finally, short-range nonstationary clutter and sidelobe clutter are suppressed by space-time adaptive segment processing. On the one hand, the proposed method realizes the accurate positioning of wind turbines through image edge detection and constant false alarm detection. On the other hand, Mahalanobis distance is used to estimate the atomic parameters of the wind turbine dictionary, which ensures the homogeneity of wind turbine samples after clutter suppression. The simulation and measured data results show that the proposed method can significantly reduce the false alarm rate caused by WTC while ensuring the effective detection of the target.

CQCNN-SV algorithm for wideband space–time adaptive processing

CQCNN-SV algorithm for wideband space–time adaptive processing

Cascade Clutter Suppression Method for Airborne Frequency Diversity Array Radar Based on Elevation Oblique Subspace Projection and Azimuth-Doppler Space-Time Adaptive Processing

Cascade Clutter Suppression Method for Airborne Frequency Diversity Array Radar Based on Elevation Oblique Subspace Projection and Azimuth-Doppler Space-Time Adaptive Processing

Clutter Rank Estimation Method for Bistatic Radar Systems Based on Prolate Spheroidal Wave Functions

Bistatic radar exhibits spatial isomerism and diverse configurations, leading to unique clutter characteristics distinct from those of monostatic radar. The clutter rank serves as a pivotal indicator of clutter characteristics, enabling the quantification of clutter severity. Space-time adaptive processing (STAP) is a critical technique to detect moving targets, and clutter rank determines the number of independent and identically distributed (IID) training samples and the degree of freedom (DOF) for effective suppression of clutter that STAP requires. Therefore, the accurate estimation of clutter rank for bistatic radar can provide a crucial indicator for designing and constructing STAP processors, thereby facilitating fast and efficient clutter suppression in bistatic radar systems. This study is based on the idea that clutter rank is the number of prolate spheroidal wave function (PSWF) orthogonal bases utilized for approximating the clutter signal. Firstly, the challenge of utilizing PSWF orthogonal bases for approximating the clutter signal in bistatic radar is elucidated. This pertains to the fact that, unlike monostatic radar clutter, bistatic radar clutter is not capable of being expressed as a single-frequency signal. The clutter rank estimation for bistatic radar is thus derived as the frequency bandwidth estimation. Secondly, to achieve this estimation, the frequency distribution of each individual scattering unit is investigated, thereby determining their extending frequency broadening (EFB) as compared to that of single-frequency. Subsequently, the integral average of EFB across the entire range bin is computed, ultimately enabling the acquisition of bistatic radar’s frequency bandwidth. Finally, the estimation method is extended to non-side-looking mode and limited observation areas with pattern modulation. Simulation experiments confirm that our proposed method provides accurate clutter rank estimations, surpassing 99% proportions of large eigenvalues across various bistatic configurations, observation modes, and areas.

Modelling and Mitigating Wind Turbine Clutter in Space–Air Bistatic Radar

The extensive deployment of wind farms has significantly impacted the detection capabilities of space–air bistatic radar (SABR) systems. Although space–time adaptive processing techniques are available, their performance is significantly degraded, and even unable to suppress clutter. This paper explores the geometric configuration of the SABR system and the selection of detection areas, establishing a space–time clutter model that addresses the effects of wind turbine clutter (WTC). Expressions for spatial and Doppler frequencies have been derived to deeply analyze the characteristics of clutter spreading. Building on this, the paper extends two-dimensional space–time data to three-dimensional azimuth–elevation–Doppler data. It proposes a three-dimensional space–time multi-beam (STMB) strategy incorporating the Ordering Points to Identify the Clustering Structure (OPTICS) clustering algorithm to suppress WTC effectively. This algorithm selects WTC samples and applies OPTICS clustering to the clutter-suppressed data to achieve this effect. Simulation experiments further verify the effectiveness of the algorithm.

An Efficient Sparse Recovery STAP Algorithm for Airborne Bistatic Radars Based on Atomic Selection under the Bayesian Framework

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.

A Data and Model-Driven Clutter Suppression Method for Airborne Bistatic Radar Based on Deep Unfolding

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.

IMPROVE THE SAFETY OF AIR TRANSPORT, ESPECIALLY IN MILITARIZED TERRAIN, BY USE OF SIDE LOOKING AIRBORNE RADAR AND SPACE TIME ADAPTIVE PROCESSING

The paper explores the potential to enhance aviation safety, particularly in militarized regions, by outfitting aircraft with Side Looking Airborne Radar (SLAR) and employing space-time adaptive processing (STAP) algorithms. The research objective revolves around implementing a model of side-looking airborne radar and the corresponding STAP algorithms. This technology enables the detection of slow-moving targets amidst strong interference, encompassing both passive (clutter) and active (jammer) elements. Slow-moving targets relative to the aircraft's speed include tanks, combat vehicles, command vehicles, artillery, and logistical assets of enemy forces. The theoretical framework of space-time adaptive processing is presented, elucidating the sequential steps of the classical Sample Matrix Inversion Space-Time Adaptive Processing (SMI STAP) algorithm. The paper underscores the significance of characteristic parameters delineating a linear STAP processor. The proposed solution facilitates the detection of enemy combat measures and enhances aviation safety. It outlines a radar model installed beneath the aircraft's fuselage and elucidates algorithms for space-time adaptive processing of radar signals. The simulations conducted within the article were executed using the MATLAB environment. The simulation results indeed suggest that the proposed solution holds promise for deployment in equipping aircraft of one's own military and those engaged in operations within conflict zones. This paper stands as one of the few contributions in the literature addressing the augmentation of aircraft safety through radar and space-time adaptive processing.

Knowledge-aided multi-dictionary block sparsity-aware STAP for airborne polarimetric conformal array radar

Airborne polarimetric conformal array radar has gained increased attention recently. However, the conformal array configuration and polarization factors may lead to non-stationary clutter, which significantly degrades the performance of space–time adaptive processing (STAP), particularly in short-range clutter environments. In this paper, we introduce a knowledge-aided multi-dictionary block sparse Bayesian learning (KA-MDBSBL) algorithm to improve the clutter suppression performance. Using prior knowledge, the proposed algorithm designs multi-dictionary matrices for each training sample, rather than a single dictionary matrix for the cell under test (CUT). We take advantage of the identical clutter profile under each dictionary matrix. In the multi-dictionary case, we enforce shared sparsity in the clutter profiles. Additionally, we utilize the inherent block structure of the dictionary matrix to jointly recover clutter and noise power through a fast convergence learning framework. Subsequently, the clutter plus noise covariance matrix is reconstructed using precisely estimated clutter and noise power, along with the dictionary matrix corresponding to the CUT. Numerical simulations are included to demonstrate the effectiveness and superiority of the proposed algorithm.

A Novel Fast Iterative STAP Method with a Coprime Sampling Structure.

In space-time adaptive processing (STAP), the coprime sampling structure can obtain better clutter suppression capabilities at a lower hardware cost than the uniform linear sampling structure. However, in practical applications, the performance of the algorithm is often limited by the number of training samples. To solve this problem, this paper proposes a fast iterative coprime STAP algorithm based on truncated kernel norm minimization (TKNM). This method establishes a virtual clutter covariance matrix (CCM), introduces truncated kernel norm regularization technology to ensure the low rank of the CCM, and transforms the non-convex problem into a convex optimization problem. Finally, a fast iterative solution method based on the alternating direction method is presented. The effectiveness and accuracy of the proposed algorithm are verified through simulation experiments.

Airborne Radar Space–Time Adaptive Processing Algorithm Based on Dictionary and Clutter Power Spectrum Correction

Sparse recovery space–time adaptive processing (SR-STAP) technology improves the moving target detection performance of airborne radar. However, the sparse recovery method with a fixed dictionary usually leads to an off-grid effect. This paper proposes a STAP algorithm for airborne radar based on dictionary and clutter power spectrum joint correction (DCPSJC-STAP). The algorithm first performs nonlinear regression in a non-stationary clutter environment with unknown yaw angles, and it corrects the corresponding dictionary for each snapshot by updating the clutter ridge parameters. Then, the corrected dictionary is combined with the sparse Bayesian learning algorithm to iteratively update the required hyperparameters, which are used to correct the clutter power spectrum and estimate the clutter covariance matrix. The proposed algorithm can effectively overcome the off-grid effect and improve the moving target detection performance of airborne radar in actual complex clutter environments. Simulation experiments verified the effectiveness of this algorithm in improving clutter estimation accuracy and moving target detection performance.

A novel sparse recovery space‐time adaptive processing algorithm using the log‐sum penalty to approximate the ℓ0 − norm penalty

AbstractApplying the sparse recovery (SR) technique to airborne radar space‐time adaptive processing (STAP) can greatly reduce the number of required training samples, which is advantageous in detecting targets in non‐homogeneous and non‐stationary clutter environments. However, the poor performance, the slow convergence speed or the high computational complexity of the traditional SR STAP algorithms limit their practical application. To tackle this problem, a novel efficient SR STAP algorithm is proposed. The newly proposed SR STAP algorithm utilises the log‐sum penalty to approximate the penalty, which exhibits improved convergence performance and clutter suppression performance compared to the traditional SR STAP algorithms. Besides, the proposed algorithm can ensure the convergence in each iteration by offering a closed‐form analytic solution. Furthermore, the result of the mathematical derivation demonstrates the essential equivalence between our method and the iterative reweighted method. By utilising this equivalence, two additional methods are proposed that incorporate the knowledge of the clutter Capon spectrum and the clutter spectrum of the iterative adaptive approach (IAA) as the components of weighted values, resulting in further performance improvement of the proposed algorithm. Finally, simulation results with both simulated data and Mountain‐Top data demonstrate the high effectiveness and performance of the proposed methods.

A Fast IAA–Based SR–STAP Method for Airborne Radar

Space–time adaptive processing (STAP) is an effective technology in clutter suppression and moving target detection for airborne radar. When working in the heterogeneous environment, the number of training samples that satisfy independent and identically distributed (IID) conditions is insufficient, making it difficult to ensure the estimation accuracy of the clutter plus noise covariance matrix for traditional STAP methods. Sparse recovery–based STAP (SR–STAP) methods have received widespread attention in the past few years. The accurate estimation of the clutter plus noise covariance matrix can be achieved using only a few training samples. The iterative adaptive approach (IAA) can quickly and accurately estimate the power spectrum, but applying this method directly to the STAP method cannot produce good performance. In this paper, a fast IAA–based SR–STAP method is proposed. Based on the weighted l1 problem, the IAA spectrum is used as a weighted term to obtain a good approximation. In order to obtain an analytical solution, we use the weighted l2 norm to approximate the weighted l1 norm without loss of performance. Compared with the IAA–STAP method, the proposed method is more robust to errors. Moreover, the proposed method has a fast computational speed. The effectiveness of the proposed method is demonstrated by simulations.

Space-time adaptive processing algorithm via reciprocal-filter for airborne passive radar

Space-time adaptive processing algorithm via reciprocal-filter for airborne passive radar

Reweighted Extreme Learning Machine-Based Clutter Suppression and Range Compensation Algorithm for Non-Side-Looking Airborne Radar

Non-side-looking airborne radar provides important applications on account of its all-round multi-angle airspace coverage. However, it suffers clutter range dependence that makes the samples fail to satisfy the condition of being independent and identically distributed (IID), and it severely degrades traditional approaches to clutter suppression and target detection. In this paper, a novel reweighted extreme learning machine (ELM)-based clutter suppression and range compensation algorithm is proposed for non-side-looking airborne radar. The proposed method involves first designing the pre-processing stage, the special reweighted complex-valued activation function containing an unknown range compensation matrix, and two new objective outputs for constructing an initial reweighted ELM-based network with its training. Then, two other objective outputs, a new loss function, and a reverse feedback framework driven by the specifically designed objectives are proposed for the unknown range compensation matrix. Finally, aiming to estimate and reconstruct the unknown compensation matrix, special processes of the complex-valued structures and the theoretical derivations are designed and analyzed in detail. Consequently, with the updated and compensated samples, further processing including space–time adaptive processing (STAP) can be performed for clutter suppression and target detection. Compared with the classic relevant methods, the proposed algorithm achieves significantly superior performance with reasonable computation time. It provides an obviously higher detection probability and better improvement factor (IF). The simulation results verify that the proposed algorithm is effective and has many advantages.

Persymmetric detection based on asymptotically optimal convex linear combination

Persymmetric structure has been utilized in space-time adaptive processing for heterogeneous environment, which leads to some detection methods based on persymmetric structure, such as persymmetric adaptive matched filter (PS-AMF). However, when the sample support is extremely limited, these methods still suffer the serious degradation in detection performance due to the large error in estimating covariance matrix. In this paper, an asymptotically optimal convex linear combination between transformed sample covariance matrix and identity matrix is considered herein to improve PS-AMF. The asymptotically optimal convex linear combination is conducive to diminishing the estimate error in estimating the transformed covariance matrix by weighting the transformed sample covariance matrix and identity matrix. Furthermore, the asymptotically optimal convex linear combination is improved by the reutilization of the convex linear combination, and the corresponding coefficients are derived. Then, the detection performance of the proposed method is approximately analyzed. At last, numerical simulations show that the proposed method performs well, compared with its counterparts, when the sample support is extremely limited.

A novel non-convex penalty function-based STAP algorithm for airborne passive radar systems

In conventional sparse Space-Time Adaptive Processing (STAP) algorithms, the l0-norm is often used instead of the l1-norm to relax convexity constraints. The approach presented in this paper can be mathematically reformulated as a linear problem, which can be efficiently solved using various convex optimization techniques. While this method effectively circumvents the NP-Hard complexity associated with the l0-norm, it does come with certain potential challenges. For example, the observation matrix must meet the criteria of the Restricted Isometry Property (RIP) and other stringent conditions. In this research, a novel STAP algorithm is introduced, which is based on a non-convex penalty function. This innovative algorithm substitutes the traditional l0-norm with a custom-designed non-convex penalty function and is applied to the Direct Filter Processor (DFP), solved using the recursive least squares (RLS) algorithm. The resulting algorithm, known as gp-RLS, is demonstrated through Monte Carlo simulations to outperform other l1-based and reduced-rank STAP algorithms in terms of faster convergence, improved signal-to-clutter-plus-noise ratio (SCNR), and enhanced target detection performance.

A Reduced Sparse Dictionary Reconstruction Algorithm Based on Grid Selection

A sparse dictionary reconstruction algorithm based on grid selection is introduced to solve the grid mismatch when using the sparse recovery space time adaptive processing (SR-STAP) algorithm. First, the atom most closely related to clutter is selected from the traditional dictionary through the spectral value dimensionality reduction method. The local mesh is divided around the selected atoms to create mesh cells, and the mesh cells that are most likely to appear in the real clutter points are judged according to the local selection iteration criteria. In this way, the mesh spacing is refined, the local mesh selection is carried out step by step, and the optimal atoms in the local region are constantly adjusted and selected to narrow the search region until the iteration termination condition is met. Finally, the space-time plane is divided using a novel meshing technique that centers around the optimal atom. By removing atoms beyond the maximum range of spatial and Doppler frequencies, the simplified sparse dictionary can overcome the mesh mismatch problem. The simulation results demonstrate that the algorithm enhances the sparse recovery accuracy of clutter space-time spectrum, mitigates the mesh mismatch effect, and boosts STAP performance.