Abstract
The problem of designing matched filters which are robust (or stable) with respect to uncertainty in signal and noise statistics is considered. General results are presented for a maximum definition of robustness which applies to several matched-filtering problems including both the discrete-time and continuous-time cases of one and two-dimensional matched filtering.
Original language | English (US) |
---|---|
Pages | 514-518 |
Number of pages | 5 |
State | Published - 1979 |
Event | Midwest Symp on Circuits and Syst, 22nd - Philadelphia, PA, USA Duration: Jun 17 1979 → Jun 19 1979 |
Other
Other | Midwest Symp on Circuits and Syst, 22nd |
---|---|
City | Philadelphia, PA, USA |
Period | 6/17/79 → 6/19/79 |
All Science Journal Classification (ASJC) codes
- General Engineering