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.