By Topic

Wiener filter design using polynomial equations

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

2 Author(s)
A. Ahlen ; Dept. of Technol., Uppsala Univ., Sweden ; M. Sternad

A simplified way of deriving realizable and explicit Wiener filters is presented. Discrete-time problems are discussed in a polynomial equation framework. Optimal filters, predictors, and smoothers are calculated by means of spectral factorizations and linear polynomial equations. A tool for obtaining these equations, for a given problem structure, is described. It is based on the evaluation of orthogonality in the frequency domain, by means of canceling stable poles with zeros. Comparisons are made to previously known derivation methodologies such as completing the squares for the polynomial systems approach and the classical Wiener solution. The simplicity of the proposed derivation method is particularly evident in multistage filtering problems. To illustrate, two examples are discussed: a filtering and a generalized deconvolution problem. A new solvability condition for linear polynomial equation appearing in scalar problems is also presented

Published in:

IEEE Transactions on Signal Processing  (Volume:39 ,  Issue: 11 )