A computation and memory efficient implementation of STAP for an airborne side-looking radar

Two new methods for implementing full rank Space Time Adaptive Processing (STAP) are introduced in this paper. The motivation behind this work is to implement a full rank STAP algorithm for an airborne side-looking radar which can be easily parallelised and implemented on Graphics Processing Units (GPUs) for near real-time performance. The central idea for both the methods is to use a least squares approach directly on the raw data instead of a covariance matrix to calculate the adaptive filter weights. Both methods are compared in terms of computation cost, resource requirements and target detection performance using MCARM dataset with well established methods such as Sample Matrix Inversion (SMI) STAP and the Hung-Turner method.

[1]  Z. Bao,et al.  Robust space-time adaptive processing for airborne radar in nonhornogeneous clutter environments , 2003 .

[2]  Robert H. Halstead,et al.  Matrix Computations , 2011, Encyclopedia of Parallel Computing.

[3]  Joseph R. Guerci,et al.  Space-Time Adaptive Processing for Radar , 2003 .

[4]  Richard Klemm,et al.  Applications of Space-Time Adaptive Processing , 2004 .

[5]  James Ward,et al.  Space-time adaptive processing for airborne radar , 1994, 1995 International Conference on Acoustics, Speech, and Signal Processing.

[6]  J. C. A. Barata,et al.  The Moore–Penrose Pseudoinverse: A Tutorial Review of the Theory , 2011, 1110.6882.

[7]  Eric Hung,et al.  A Fast Beamforming Algorithm for Large Arrays , 1983, IEEE Transactions on Aerospace and Electronic Systems.

[8]  T.K. Sarkar,et al.  A deterministic, eigenvalue approach to space time adaptive processing , 1996, IEEE Antennas and Propagation Society International Symposium. 1996 Digest.

[9]  Yunhan Dong Approximate Invariance of the Inverse of the Covariance Matrix and the Resultant Pre-Built STAP Processor , 2005 .