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     

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.     

Adaptive cancellation method for geometry-induced nonstationary bistatic clutter environments

This paper describes and characterizes a new bistatic space-time adaptive processing (STAP) clutter mitigation method. The approach involves estimating and compensating aspects of the spatially varying bistatic clutter response in both angle and Doppler prior to adaptive clutter suppression. An important feature of the proposed method is its ability to extract requisite implementation information from the data itself, rather than rely on ancillary - and possibly erroneous or missing - system measurements. We justify the essence of the proposed method by showing its ability to align the dominant clutter subspaces of each range realization relative to a suitably chosen reference point as a means of homogenizing the space-time data set. Moreover, we numerically characterize performance using synthetic bistatic clutter data. For the examples considered herein, the proposed bistatic STAP method leads to maximum performance improvements between 17.25 dB and 20.75 dB relative to traditional STAP application, with average improvements of 6 dB to 10 dB.     

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     

Reduced-rank STAP 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. It is shown that reduced-rank (RR) methods outperform full-rank space-time adaptive processing (STAP) when the space-time covariance matrix is estimated from a data set with limited support. The utility of RR methods is demonstrated by theoretical analysis, simulations and analysis of real data. It is shown that RR processing has two opposite effects on the performance: increased statistical stability which tends to improve performance, and introduction of a bias which lowers the signal-to-noise ratio (SNR). A method for evaluating the theoretical conditioned SNR for fixed RR transforms is also presented. It Is shown that while best performance is obtained using data-dependent transforms, the loss incurred by the application of fixed transforms (such as the discrete cosine transform) may be relatively small. The main advantage of fixed transforms is the availability of efficient computational procedures for their implementation. These findings suggest that RR methods could facilitate the development of practical, real-time STAP technology     

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.     

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.     

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.     

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     

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).     

Coordinate Conversion and Tracking for Very Long Range Radars

The problem of tracking with very long range radars is studied in this paper. First, the measurement conversion from a radar's r-u-v coordinate system to the Cartesian coordinate system is discussed. Although the nonlinearity of this coordinate transformation appears insignificant based on the evaluation of the bias of the converted measurements, it is shown that this nonlinearity can cause significant covariance inconsistency in the conventionally converted measurements (CM1). Since data association depends critically on filter consistency, this issue is very important. Following this, it is shown that a suitably corrected conversion (CM2) eliminates the inconsistency. Then, initialized with the converted measurements (using CM2), four Cartesian filters are evaluated. It is shown that, among these filters, the converted measurement Kalman filter with second order Taylor expansion (CM2KF) is the only one that is consistent for very long range tracking scenarios. Another two approaches, the range-direction-cosine extended Kalman filter (ruvEKF) and the unscented Kalman filter (UKF) are also evaluated and shown to suffer from consistency problems. However, the CM2KF has the disadvantage of reduced accuracy in the range direction. To fix this problem, a consistency-based modification for the standard extended Kalman filter (E1KF) is proposed. This leads to a new filtering approach, designated as measurement covariance adaptive extended Kalman filter (MCAEKF). For very long range tracking scenarios, the MCAEKF is shown to produce consistent filtering results and be able to avoid the loss of accuracy in the range direction. It is also shown that the MCAEKF meets the posterior Carmer-Rao lower bound for the scenarios considered.     

圆台阵列杂波模型及空时二维自适应处理

针对圆台共形阵列,建立了空时二维自适应处理(STAP)的杂波模型,给出了圆台阵列杂波抑制最优权值的计算方法。在此基础之上,为了实现可应用到实际环境中的自适应处理方法,进一步讨论了将局部联合域(JDL)降维算法推广至圆台阵列中的问题。得出了圆台阵列JDL算法降维变换矩阵的表达形式,研究了参考波束的数目选取、波束指向等因素对降维损失的影响。理论分析以及仿真结果表明,通过合理选择通道数、波束方位向指向间隔等参数,该算法能够减少自适应波束形成的计算量,而且可以用较少的训练样本获得较好的处理性能。     

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     

Square root parallel Kalman filtering using reduced-order localfilters

The basic parallel Kalman filtering algorithms derived by H.R. Hashemipour et al. (IEEE Trans. Autom. Control. vol.33, p.88-94, 1988) are summarized and generalized to the case of reduced-order local filters. Measurement-update and time-update equations are provided for four implementations: the conventional covariance filter, the conventional information filter, the square-foot covariance filter, and the square-foot information filter. A special feature of the suggested architecture is the ability to accommodate parallel local filters that have a smaller state dimension than the global filter. The estimates and covariance or information matrices (or their square roots) from these reduced-order filters are collated at a central filter at each step to generate the full-size, globally optimal estimates and their associated error covariance or information matrices (or their square roots). Aspects of computational complexity and the ensuing tradeoff with communication are discussed     

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     

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.     

Automatic target classification of slow moving ground targets in clutter

A new approach is proposed which will allow air-to-ground target classification of slow moving vehicles in clutter. A wideband space-time adaptive (STAP) filter architecture, based on subbanding, is developed and coupled with a one dimensional template-based minimum mean squared error (MMSE) classifier. The performance of this STAP/ATC (automatic target classification) algorithm is quantified using an extensive simulation. The level of residual clutter afforded by various filter configurations and the associated incremental improvement in ATC performance is quantified, revealing the potential for realizable hardware and software implementations to achieve acceptable ATC performance.     

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

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

均方意义下三维雷达无偏转换测量误差协方差阵的推导

在以前的研究中,无偏转测量误差协方差阵是基于当前测量值得到的.为了能利用所有历史数据以得到更精确的转换测量误差协方差阵估计,文中在均方意义下,推导了三维雷达的最优无偏转换测量误差协方差阵.     

Efficient robust AMF using the FRACTA algorithm

The FRACTA algorithm has been shown to be an effective space-time adaptive processing (STAP) methodology for the airborne radar configuration in which there exists nonhomogeneous clutter, jamming, and dense target clusters. Further developments of the FRACTA algorithm are presented here in which the focus is on the robust, efficient implementation of the FRACTA algorithm. Enhancements to the FRACTA algorithm include a censoring stopping mechanism, an alternative data blocking approach for adaptive power residue (APR) censoring, and a fast reiterative censoring (RC) procedure. Furthermore, a coherent processing interval (CPI) segmentation scheme for computing the adaptive weights is presented as an alternative approach to computing the adaptive matched filter (AMF) weight vector that allows for lower sample support and reduced computational complexity. The enhanced FRACTA algorithm, denoted as FRACTA.E, is applied to the KASSPER I challenge datacube which possesses dense ground target clusters that are known to have a significant deleterious effect on standard adaptive matched filtering (AMF) processors. It is shown that the FRACTA.E algorithm outperforms and is considerably more computationally efficient than both the original FRACTA algorithm and the standard sliding window processing (SWP) approach. Furthermore, using the KASSPER I datacube, the FRACTA.E algorithm is shown to have the same detection performance as the clairvoyant algorithm where the exact range-dependent clutter covariance matrices are known.