Minimax Robust Discrete-Time Matched Filters

Sergio Verdu, H. Vincent Poor

Research output: Contribution to journalArticlepeer-review

37 Scopus citations

Abstract

The problem of designing finite-length discrete-time matched filters is considered for situations in which exact knowledge of the input signal and/or noise characteristics is not available. Such situations arise in many applications due to channel distortion, incoherencies, nonlinear effects, and other modeling uncertainties. In such cases it is often of interest to design a minimax robust matched filter, i.e., a nonadaptive filter with an optimum level of worst-case performance for the expected uncertainty class. This problem is investigated here for three types of uncertainty models for the input signal, namely, the mean-absolute, mean-square, and maximum-absolute distortion classes, and for a wide generality of norm-deviation models for the noise covariance matrix. Some numerical examples illustrate the robustness properties of the proposed designs.

Original languageEnglish (US)
Pages (from-to)208-215
Number of pages8
JournalIEEE Transactions on Communications
Volume31
Issue number2
DOIs
StatePublished - Feb 1983

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Minimax Robust Discrete-Time Matched Filters'. Together they form a unique fingerprint.

Cite this