Reduced-rank STAP for high PRF radar

Due to the range ambiguity of high pulse-repetition frequency (HPRF) radars, echoes from far-range fold over near-range returns. This effect may cause low Doppler targets to compete with near-range strong clutter. Another consequence of the range ambiguity is that the sample support for estimating the array covariance matrix is reduced, leading to degraded performance. It is shown that space-time adaptive processing (STAP) techniques are required to reject the clutter in HPRF radar. Four STAP methods are studied in the context of the HPRF radar problem: low rank approximation sample matrix inversion (SMI), diagonally loaded SMI, eigencanceler, and element-space post-Doppler. These three methods are evaluated in typical HPRF radar scenarios and for various training conditions, including when the target is present in the training data     

Reiterative median cascaded canceler for robust adaptive array processing

A new robust adaptive processor based on reiterative application of the median cascaded canceler (MCC) is presented and called the reiterative median cascaded canceler (RMCC). It is shown that the RMCC processor is a robust replacement for the sample matrix inversion (SMI) adaptive processor and for its equivalent implementations. The MCC, though a robust adaptive processor, has a convergence rate that is dependent on the rank of the input interference-plus-noise covariance matrix for a given number of adaptive degrees of freedom (DOF), N. In contrast, the RMCC, using identical training data as the MCC, exhibits the highly desirable combination of: 1) convergence-robustness to outliers/targets in adaptive weight training data, like the MCC, and 2) fast convergence performance that is independent of the input interference-plus-noise covariance matrix, unlike the MCC. For a number of representative examples, the RMCC is shown to converge using ~ 2.8N samples for any interference rank value as compared with ~ 2N samples for the SMI algorithm. However, the SMI algorithm requires considerably more samples to converge in the presence of outliers/targets, whereas the RMCC does not. Both simulated data as well as measured airborne radar data from the multichannel airborne radar measurements (MCARM) space-time adaptive processing (STAP) database are used to illustrate performance improvements over SMI methods.     

Spectral-domain covariance estimation with a priori knowledge

A knowledge-aided spectral-domain approach to estimating the interference covariance matrix used in space-time adaptive processing (STAP) is proposed. Prior knowledge of the range-Doppler clutter scene is used to identify geographic regions with homogeneous scattering statistics. Then, minimum-variance spectral estimation is used to arrive at a spectral-domain clutter estimate. Finally, space-time steering vectors are used to transform the spectral-domain estimate into a data-domain estimate of the clutter covariance matrix. The proposed technique is compared with ideal performance and to the fast maximum likelihood technique using simulated results. An investigation of the performance degradation that can occur due to various inaccurate knowledge assumptions is also presented     

Framework and Taxonomy for Radar Space-Time Adaptive Processing (STAP) Methods

The goal of radar space-time adaptive processing (STAP) is to detect slow moving targets from a moving platform, typically airborne or spaceborne. STAP generally requires the estimation and the inversion of an interference-plus-noise (I+N) covariance matrix. To reduce both the number of samples involved in the estimation and the computational cost inherent to the matrix inversion, many suboptimum STAP methods have been proposed. We propose a new canonical framework that encompasses all suboptimum STAP methods we are aware of. The framework allows for both covariance-matrix (CM) estimation and range-dependence compensation (RDC); it also applies to monostatic and bistatic configurations. Finally, we discuss a taxonomy for classifying the methods described by the framework.     

Stap using knowledge-aided covariance estimation and the fracta algorithm

In the airborne space-time adaptive processing (STAP) setting, a priori information via knowledge-aided covariance estimation (KACE) is employed in order to reduce the required sample support for application to heterogeneous clutter scenarios. The enhanced FRACTA (FRACTA.E) algorithm with KACE as well as Doppler-sensitive adaptive coherence estimation (DS-ACE) is applied to the KASSPER I & II data sets where it is shown via simulation that near-clairvoyant detection performance is maintained with as little as 1/3 of the normally required number of training data samples. The KASSPER I & II data sets are simulated high-fidelity heterogeneous clutter scenarios which possess several groups of dense targets. KACE provides a priori information about the clutter covariance matrix by exploiting approximately known operating parameters about the radar platform such as pulse repetition frequency (PRF), crab angle, and platform velocity. In addition, the DS-ACE detector is presented which provides greater robustness for low sample support by mitigating false alarms from undernulled clutter near the clutter ridge while maintaining sufficient sensitivity away from the clutter ridge to enable effective target detection performance     

Multistage partially adaptive STAP CFAR detection algorithm

A new method of partially adaptive constant false-alarm rate (CFAR) detection is introduced. The processor implements a novel sequence of orthogonal subspace projections to decompose the Wiener solution in terms of the cross-correlation observed at each stage. The performance is evaluated using the general framework of space-time adaptive processing (STAP) for the cases of both known and unknown covariance. It is demonstrated that this new approach to partially adaptive STAP outperforms the more complex eigen-analysis approaches using both simulated DARPA Mountain Top data and true pulse-Doppler radar data collected by the MCARM radar     

Median cascaded canceller for robust adaptive array processing

A median cascaded canceller (MCC) is introduced as a robust multichannel adaptive array processor. Compared with sample matrix inversion (SMI) methods, it is shown to significantly reduce the deleterious effects of impulsive noise spikes (outliers) on convergence performance of metrics; such as (normalized) output residue power and signal to interference-plus-noise ratio (SINR). For the case of no outliers, the MCC convergence performance remains commensurate with SMI methods for several practical interference scenarios. It is shown that the MCC offers natural protection against desired signal (target) cancellation when weight training data contains strong target components. In addition, results are shown for a high-fidelity, simulated, barrage jamming and nonhomogenous clutter environment. Here the MCC is used in a space-time adaptive processing (STAP) configuration for airborne radar interference mitigation. Results indicate the MCC produces a marked SINR performance improvement over SMI methods.     

Knowledge-based space-time adaptive processing for airborne earlywarning radar

This paper describes an innovative concept for knowledge-based control of space-time adaptive processing (STAP) for airborne early warning radar. The knowledge-based approach holds potential for significant performance improvements over classical STAP processing in nonhomogeneous environments by taking advantage of a priori knowledge. Under this approach, knowledge-based control is used to direct pre-adaptive filtering, and to carefully select STAP algorithms, parameters, and secondary data cells     

Partially Adaptive STAP using the FRACTA Algorithm

A partially adaptive space-time adaptive processor (STAP) utilizing the recently developed FRACTA algorithm is presented which significantly reduces the high computational complexity and large sample support requirements of fully adaptive STAP. Multi-window post-Doppler dimensionality reduction techniques are employed to transform the data prior to application of the FRACTA algorithm. The FRACTA algorithm is a reiterative censoring (RC) and detection algorithm which has been shown to provide excellent detection performance in nonhomogeneous interference environments. Two multi-window post-Doppler dimensionality reduction techniques are considered: PRI-staggered and adjacent-bin. The partially adaptive FRACTA algorithm is applied to the KASSPER I (Knowledge-Aided Sensor Signal Processing & Expert Reasoning) challenge datacube. The pulse repetition interval (PRI)-staggered approach with D=6 filters per Doppler bin is found to provide the best detection performance, outperforming the fully adaptive case while simultaneously reducing the runtime by a factor of ten. Using this implementation, partially adaptive FRACTA detects 197 out of 268 targets with one false alarm. The clairvoyant processor (the covariance matrix for each range cell is known) detects 198 targets with one false alarm. In addition, the partially adaptive FRACTA algorithm is shown to be resilient to jamming, and performs well for reduced sample support situations. When compared with partially adaptive STAP using traditional sliding window processing (SWP), the runtime of partially adaptive FRACTA is 14 times faster, and the detection performance is significantly increased (SWP detects 46 out of 268 targets with one false alarm).     

An approach to knowledge-aided covariance estimation

This paper introduces a parametric covariance estimation scheme for use with space-time adaptive processing (STAP) methods operating in heterogeneous clutter environments. The approach blends both a priori knowledge and data observations within a parameterized model to capture instantaneous characteristics of the cell under test (CUT) and reduce covariance errors leading to detection performance loss. We justify this method using both measured and synthetic data. Performance potential for the specific operating conditions examined herein include: 1) averaged behavior within roughly 2 dB of the optimal filter, 2) 1 dB improvement in exceedance characteristic relative to the optimal filter, highlighting improved instantaneous capability, and 3) impervious ness to corruptive target-like signals in the secondary data (no additional signal-to-interference-plus-noise ratio (SINK) loss, compared with 10 dB or greater loss for the standard STAP implementation), with corresponding detections comparable to the optimal filter case     

Space-time adaptive radar performance in heterogeneous clutter

Traditional analysis of space-time adaptive radar generally assumes the ideal condition of statistically independent and identically distributed (IID) secondary data. To the contrary, measured data suggests realistic clutter environments appear heterogeneous and so the secondary data is no longer IID. Heterogeneity leads to mismatch between actual and estimated covariance matrices, thereby magnifying the loss between the adaptive implementation and optimum condition. Concerns regarding the impact of clutter heterogeneity on space-time adaptive processing (STAP) warrant further study. To this end, we propose space-time models of amplitude and spectral clutter heterogeneity, with operational airborne radar in mind, and then characterize expected STAP performance loss under such heterogeneous scenarios. Simulation results reveal loss in signal-to-interference plus noise ratio (SINR) ranging between a few tenths of a decibel to greater than 16 dB for specific cases     

Sensitivity of MIMO STAP Radar with Waveform Diversity

Space-time adaptive processing (STAP) is an effective method adopted in airborne radar to suppress ground clutter. Multiple-input multiple-output (MIMO) radar is a new radar concept and has superiority over conventional radars. Recent proposals have been applying STAP in MIMO configuration to the improvement of the performance of conventional radars. As waveforms transmitted by MIMO radar can be correlated or uncorrelated with each other, this article develops a unified signal model incorporating waveforms for STAP in MIMO radar with waveform diversity. Through this framework, STAP performances are expressed as functions of the waveform covariance matrix (WCM). Then, effects of waveforms can be investigated. The sensitivity, i.e., the maximum range detectable, is shown to be proportional to the maximum eigenvalue of WCM. Both theoretical studies and numerical simulation examples illustrate the waveform effects on the sensitivity of MIMO STAP radar, based on which we can make better trade-off between waveforms to achieve optimal system performance.     

一种基于协方差矩阵加权的阵元误差补偿STAP处理

机载多通道阵列雷达天线在工程实践中不可避免地存在各类阵元误差,所产生的通道失配问题会对空时二维自适应处理的性能造成大的影响。对存在阵元误差时的阵列信号模型进行了分析,提出了一种基于协方差矩阵加权（CMT）的阵元误差补偿空时自适应处理（STAP）方法,在工程应用中该加权矩阵可通过地面天线定标及校飞过程确定,通过对总干扰协方差矩阵估计的加权预处理,可将实际阵元误差对STAP性能的影响控制在测量误差的影响范围,最后通过仿真验证了算法的有效性。     

Airborne/spacebased radar STAP using a structured covariance matrix

It is shown that partial information about the airborne/spacebased (A/S) clutter covariance matrix (CCM) can be used effectively to significantly enhance the convergence performance of a block-processed space/time adaptive processor (STAP) in a clutter and jamming environment. The partial knowledge of the CCM is based upon the simplified general clutter model (GCM) which has been developed by the airborne radar community. A priori knowledge of parameters which should be readily measurable (but not necessarily accurate) by the radar platform associated with this model is assumed. The GCM generates an assumed CCM. The assumed CCM along with exact knowledge of the thermal noise covariance matrix is used to form a maximum likelihood estimate (MLE) of the unknown interference covariance matrix which is used by the STAP. The new algorithm that employs the a priori clutter and thermal noise covariance information is evaluated using two clutter models: 1) a mismatched GCM, and 2) the high-fidelity Research Laboratory STAP clutter model. For both clutter models, the new algorithm performed significantly better (i.e., converged faster) than the sample matrix inversion (SMI) and fast maximum likelihood (FML) STAP algorithms, the latter of which uses only information about the thermal noise covariance matrix.     

Eigenanalysis-based space-time adaptive radar: performance analysis

The space-time radar problem is well suited to the application of techniques that take advantage of the low rank property of the space-time covariance matrix. The performance of an eigenanalysis-based detector with respect to convergence rate and robustness to calibration errors is analyzed. Analytical expressions are developed for receiver operating curves when the clutter signal environment is assumed to be Gaussian. The curves are derived from the asymptotic expansion of the distribution of the principal components of the covariance matrix. Simulation results are provided to corroborate the theoretical analysis. Examples from the Mountain-Top dataset are used to illustrate the higher convergence rate and increased robustness of the eigenanalysis method.     

NEW METHOD FOR REDUCED RANK STAP—NON CLUTTER CHANNEL METHOD

Space- time adaptive processing(STAP) is aleading technology candidate for improving detec-tion performance of advanced airborne early warn-ing radar.In practical radar systems,the optimumfully adaptive space- time processing[1] cannot al-ways be implemented because of the computationalcomplexity,so the design of suboptimum proces-sors has been one of the key topics in STAP.Sev-eral reduced- rank STAP methods have been pro-posed in recent years.For example,based on thegeneralized sidelobe…     

Optimal and adaptive reduced-rank STAP

This paper is concerned with issues and techniques associated with the development of both optimal and adaptive (data dependent) reduced-rank signal processing architectures. Adaptive algorithms for 1D beamforming, 2D space-time adaptive processing (STAP), and 3D STAP for joint hot and cold clutter mitigation are surveyed. The following concepts are then introduced for the first time (other than workshop and conference records) and evaluated in a signal-dependent versus signal independent context: (1) the adaptive processing “region-of-convergence” as a function of sample support and rank, (2) a new variant of the cross-spectral metric (CSM) that retains dominant mode estimation in the direct-form processor (DFP) structure, and (3) the robustness of the proposed methods to the subspace “leakage” problem arising in many real-world applications. A comprehensive performance comparison is conducted both analytically and via Monte Carlo simulation which clearly demonstrates the superior theoretical compression performance of signal-dependent rank-reduction, its broader region-of-convergence, and its inherent robustness to subspace leakage     

Comparison between monostatic and bistatic antenna configurationsfor STAP

The unique characteristics of bistatic radar operation on the performance of airborne/spaceborne moving target indicator (MTI) radars that use space-time adaptive processing (STAP) are discussed. It has been shown that monostatic STAP radar has the following properties. 1) For a horizontal flight path and a planar Earth the curves of constant clutter Doppler (isodops) are hyperbolas. 2) For a sidelooking antenna geometry the clutter Doppler is range independent. 3) Clutter trajectories in the cosφ-F plane (F=normalized Doppler) are in general ellipses (or straight lines for a sidelooking array). We demonstrate that these well-known properties are distorted by the displacement between transmitter and receiver in a bistatic configuration. It is shown that even for the sidelooking array geometry the clutter Doppler is range-dependent which requires adaptation of the STAP processor for each individual range gate. Conclusions for the design of STAP processors are drawn     

STAP for GPS receiver synchronization

A space-time adaptive processing (STAP) algorithm for delay tracking and acquisition of the GPS signature sequence with interference rejection capability is developed. The interference can consist of both broadband and narrowband jammers, and is mitigated in two steps. The narrowband jammers are modelled as vector autoregressive (VAR) processes and rejected by temporal whitening. The spatial ing is implicitly achieved by estimating a sample covariance matrix and feeding its inverse into the extended Kalman filter (EKF). The EKF estimates of the code delay and the fading channel are used for a t-test for acquisition detection. Computer simulations demonstrate robust performance of the algorithm in severe jamming, and also show that the algorithm outperforms the conventional delay-locked loop (DLL).     

Space-time autoregressive filtering for matched subspace STAP

Practical space-time adaptive processing (STAP) implementations rely on reduced-dimension processing, using techniques such as principle components or partially adaptive filters. The dimension reduction not only decreases the computational load, it also reduces the sample support required for estimating the interference statistics. This results because the clutter covariance is implicitly assumed to possess a certain (nonparametric) structure. We demonstrate how imposing a parametric structure on the clutter and jamming can lead to a further reduction in both computation and secondary sample support. Our approach, referred to as space-time autoregressive (STAR) filtering, is applied in two steps: first, a structured subspace orthogonal to that in which the clutter and interference reside is found, and second, a detector matched to this subspace is used to determine whether or not a target is present. Using a realistic simulated data set for circular array STAP, we demonstrate that this approach achieves significantly lower signal-to-interference plus noise ratio (SINR) loss with a computational load that is less than that required by other popular approaches. The STAR algorithm also yields excellent performance with very small secondary sample support, a feature that is particularly attractive for applications involving nonstationary clutter.