Importance sampling for characterizing STAP detectors

This paper describes the development of adaptive importance sampling (IS) techniques for estimating false alarm probabilities of detectors that use space-time adaptive processing (STAP) algorithms. Fast simulation using IS methods has been notably successful in the study of conventional constant false alarm rate (CFAR) radar detectors, and in several other applications. The principal objectives here are to examine the viability of using these methods for STAP detectors, develop them into powerful analysis and design algorithms and, in the long term, use them for synthesizing novel detection structures. The adaptive matched filter (AMF) detector has been analyzed successfully using fast simulation. Of two biasing methods considered, one is implemented and shown to yield good results. The important problem of detector threshold determination is also addressed, with matching outcome. As an illustration of the power of these methods, two variants of the square-law AMF detector that are thought to be robust under heterogeneous clutter conditions have also been successfully investigated. These are the envelope-law and geometric-mean STAP detectors. Their CFAR property is established and performance evaluated. It turns out the variants have detection performances better than those of the AMF detector for training data contaminated by interferers. In summary, the work reported here paves the way for development of advanced estimation techniques that can facilitate design of powerful and robust detection algorithms     

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     

Non-Gaussian random vector identification using sphericallyinvariant random processes

With the modeling of non-Gaussian radar clutter in mind, elegant and tractable techniques are presented for characterizing the probability density function (PDF) of a correlated non-Gaussian radar vector. The need for a library of multivariable correlated non-Gaussian PDFs in order to characterize various clutter scenarios is discussed. Specifically,. the theory of spherically invariant random processes (SIRPs) is examined in detail. Approaches based on the marginal envelope PDF and the marginal characteristic function have been used to obtain several multivariate non-Gaussian PDFs. An important result providing the PDF of the quadratic form of a spherically invariant random vector (SIRV) is presented. This result enables the problem of distributed identification of a SIRV to be addressed     

Computer generation of correlated non-Gaussian radar clutter

We develop computer simulation procedures which enable us to generate any correlated non-Gaussian radar clutter that can be modeled as a spherically invariant random process (SIRP). In most cases, when the clutter is a correlated non-Gaussian random process, performance of the optimal radar signal processor cannot be evaluated analytically. Therefore, in order to evaluate such processors, there is a need for efficient computer simulation of the clutter. We present two canonical simulation procedures for the generation of correlated non-Gaussian clutter. A new approach for the goodness-of-fit test is proposed in order to assess the performance of the simulation procedure