Matched subspace detectors

Abstract

We formulate a general class of problems for detecting subspace signals in subspace interference and broadband noise. We derive the generalized likelihood ratio (GLR) for each problem in the class. We then establish the invariances for the GLR and argue that these are the natural invariances for the problem. In each case, the GLR is a maximal invariant statistic, and the distribution of the maximal invariant statistic is monotone. This means that the GLR test (GLRT) is the uniformly most powerful invariant detector. We illustrate the utility of this finding by solving a number of problems for detecting subspace signals in subspace interference and broadband noise. In each case we give the distribution for the detector and compute performance curves.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>