By Topic

Optimum, linear, discrete filtering of signals containing a nonrandom component

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

The problem of filtering nonrandom signals from stationary random noise has recently received considerable attention. The filter design procedure developed by Wiener is not applicable in this case since that procedure is predicted on the assumption that the signal to be filtered is stationary and random. Lately, both Booton and the team of Zadeh and Ragazzini have developed optimum filters for the smoothing of nonrandom signals; however, both of these filters are of the continuous type, whereas in many applications in which discontinuous control is used there is need for discrete filters for such signals. This paper presents equations governing the design of a discrete version of the Zadeh-Ragazzini filter. The input signal is assumed to be the sum of a nonrandom polynomial and a stationary random component and is assumed to be obscured by stationary random noise. An approximate formula for the output noise power of an optimum filter designed to make a zero-lag estimate of either its input function or one of the derivatives thereof is derived for the important special case in which the noise is white and the signal is a nonrandom polynomial. A brief discussion is given of the use of the filter with nonrandom, nonpolynomial signals.

Published in:

Information Theory, IRE Transactions on  (Volume:2 ,  Issue: 2 )