Real time STAP for UESA RADAR
R.D. Dikeman, Kristine L. Bell, C.A. Moore, H.L. Van Trees · 2007
We present results on the implementation of circular array space time adaptive processing (C-STAP) algorithms in Lockheed Martin Orincon defense's real-time interactive programming and processing environment (RIPPEN). Full and reduced rank linearly constrained minimum variance multiple quadratic pattern constraint (LCMV-MQPC) algorithms are implemented in RIPPEN to support portability, rapid hardware implementation, analysis, and optimization on PC and mercury systems. Measures for required algorithm overhead are developed and evaluated. The complexity of STAP algorithms requires metrics drawn from full implementation and experimentation. In particular, the interplay between covariance matrix size, rank reduction techniques, available DSP chip cache memory, and matrix inverse and multiplication operations are considered. (4 pages)