Matched Subspace Detectors for Stochastic Signals
نویسندگان
چکیده
Our aim in this paper is to extend the matched subspace detectors (MSDs) of [1–3] to the detection of stochastic signals. In [1–3] the signal to be detected was assumed to be placed deterministically at an unknown location in a known signal subspace. The basis for the subspace was irrelevant. In this paper the signal is assumed to be placed randomly at an unknown location in a known subspace. If nothing is known a priori about the second-order moments of the placement, then the generalized likelihood ratio test (GLRT) for a stochastic signal turns out to be identical to the GLRT for a deterministic signal. Consequently, the MSDs are more general than originally thought, applying to the detection of a signal whose mean value or covariance matrix is modulated by a subspace signal. Moreover, the invariance sets for stochastic MSDs are identical to those of the corresponding deterministic MSD. The results of this paper extend the theory of MSDs to radar and sonar problems where random target effects may be modeled, and to data communication problems where symbols are coded by subspaces, rather than coordinates of subspaces. ∗This work supported by John Tague of ONR under contract N00014-00-C-0145. †This work supported by John Tague of ONR under contract N00014-01-1-1019-P0001.
منابع مشابه
Matched Subspace Detectors for Distinguishingbetween Two Signals with Extensions to BlindMaximum Likelihood Sequence
| The problem of distinguishing between two signals when only a ltered version of the transmitted signals is available and the coeecients of the lter are unknown gives rise to matched subspace detector. In this paper we will investigate the performance of matched subspace detectors for distinguishing between two signals. We will demonstrate that the matched subspace detector is equivalent to a ...
متن کاملMatched subspace detectors
In this paper 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 distribut...
متن کاملTime-Frequency Subspace Detectors and Application to Knock Detection
Abstract We consider a composite hypotheses detection problem involving a subspace and an energy level, and we show that for this problem the matched subspace detector is uniformly most powerful and the generalized likelihood ratio detector. We present a generalization of the matched subspace detector and time-frequency methods for the formulation and design of subspace detectors. Finally, we a...
متن کاملRobust Gaussian and non-Gaussian matched subspace detection
We address the problem of matched filter and subspace detection in the presence of arbitrary noise and interference or interfering signals that may lie in an arbitrary unknown subspace of the measurement space. A minmax methodology developed to deal with this uncertainty can also be adapted to situations where partial information on the interference or other uncertainties is available. This met...
متن کاملOptimal Detection of Multiharmonic Visually Evoked Potentials
We consider the problem of detecting visual evoked potentials (VEP's). A matched subspace lter is applied to the detection of the VEP and is demonstrated to perform better than a number of other evoked potential (EP) detectors. Unlike single-harmonic detectors, the MSF detector is suitable for detecting multi-harmonic VEP's. Moreover, the MSF is optimal in the uniformly most powerful (UMP) sens...
متن کامل