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

Author

Pulsone, Nicholas ; Zatman, Michael

Author_Institution

Lincoln Lab., MIT, Lexington, MA, USA

Volume

3

fYear

1999

fDate

15-19 Mar 1999

Firstpage

1161

Abstract

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

Keywords

adaptive signal detection; computational complexity; filtering theory; matched filters; maximum likelihood detection; probability; radar detection; radar signal processing; GLRT detector; adaptive detection; adaptive matched filter detector; computational load reduction; computationally-efficient two-step implementation; detection performance; detection probability; generalized likelihood ratio test; radar signal processing; simulation results; Benchmark testing; Computational modeling; Detectors; Laboratories; Matched filters; Performance analysis; Performance loss; Radar detection; Signal to noise ratio; Working environment noise;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1999. Proceedings., 1999 IEEE International Conference on

Conference_Location

Phoenix, AZ

ISSN

1520-6149

Print_ISBN

0-7803-5041-3

Type

conf

DOI

10.1109/ICASSP.1999.756183

Filename

756183