Performance characterization of space-time adaptive processing algorithms for distributed target detection in non-ideal environments

The use of adaptive algorithms to mitigate the detrimental effects of noise upon receivers employing antenna arrays is instrumental in modern day radar systems applications. In the majority of these algorithms, the target is assumed to be confined to only one range cell. Under practical operating conditions, the target can actually be distributed across several range cells. This signal contamination causes the performance of the adaptive algorithm to degrade. Additionally, the covariance matrix for the clutter-plus-noise is used in the design of the adaptive algorithm. This quantity is usually characterized by using samples taken from range cells surrounding the test cell. Performance suffers if the underlying covariance matrix of the test cell is different from the average covariance matrix of the surrounding range cells. Here we analyze a space-time adaptive processing (STAP) algorithm designed to utilize signal contamination to the advantage of the receiver. Expressions for performance, which incorporate the possibility of covariance matrix mismatch, are developed for such distributed target scenarios. Numerical analysis illustrates that the presented algorithm functions significantly better than traditional STAP algorithms in signal contaminated environments. This investigation also shows how variations in the parameters that describe covariance matrix mismatch affect performance.