Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

Recursive digital filter synthesis via gradient based algorithms

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
$31 $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)
Cadzow, James A. ; State University of New York, Amherst, NY

The three gradient-based algorithms of 1) steepest descent, 2) Newton's method, and 3) the linearization algorithm are applied to the problem of synthesizing linear recursive filters in the time domain. It is shown that each of these algorithms requires knowledge of the associated recursive filter's first-order sensitivity vectors, and, in the case of the Newton method, second-order sensitivity vectors as well. Systematic procedures for generating these sensitivity vectors by computing the response of a companion filter structure are then presented. Using the ideal low-pass filter as a design objective, it is then demonstrated that the linearization algorithm is particularly well suited for recursive filter design. On the other hand, the steepest descent and Newton methods are found to work rather poorly for this class of problems. Reasons for these empirical observed results are postulated.

Published in:

Acoustics, Speech and Signal Processing, IEEE Transactions on  (Volume:24 ,  Issue: 5 )