A computationally-efficient two-step implementation of the GLRT detector

A new two-step implementation of the generalized likelihood ratio test (GLRT) is proposed. A disadvantage of the GLRT detector is that it is more computationally complex than the simple adaptive matched filter (AMF) detector. The two-step implementation of the GLRT significantly reduces the computational load with a negligible loss in detection performance.

[1]  Christ D. Richmond.  Analysis of an adaptive detection algorithm for non-homogeneous environments , 1998, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181).

[2]  Daniel R. Fuhrmann,et al.  A CFAR adaptive matched filter detector , 1992 .

[3]  L.L. Scharf,et al.  Adaptive matched subspace detectors and adaptive coherence estimators , 1996, Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers.

[4]  C. Richmond,et al.  Statistical performance analysis of the adaptive sidelobe blanker detection algorithm , 1997, Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136).

[5]  E. J. Kelly.  An Adaptive Detection Algorithm , 1986, IEEE Transactions on Aerospace and Electronic Systems.