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 computat...

Full description

Saved in:
Bibliographic Details
Main Authors: Pulsone, N., Zatman, M.
Format: Conference Proceeding
Language:English
Subjects:
Benchmark testing
Computational modeling
Detectors
Laboratories
Matched filters
Performance analysis
Performance loss
Radar detection
Signal to noise ratio
Working environment noise
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1520-6149
2379-190X
DOI:10.1109/ICASSP.1999.756183