Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Least pth optimization of recursive digital filters

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

2 Author(s)
Bandler, J.W. ; McMaster University, Hamilton, Ont., Canada ; Bardakjian, B.L.

The application of the Bandler-Charalambous method using extremely large values of p, typically 10,000 to the problem of choosing the coefficients of a recursive digital filter to meet arbitrary specifications on the magnitude characteristics, is described. The Fletcher (1970) method is used in conjunction with least pth optimization and is compared with the well-known Fletcher-Powell method. Some relevant design ideas, such as local optimality checking by perturbation, increasing the order complexity of the filter through growing filter sections, and meeting the stability requirements by using a pole inversion technique, have been implemented. A general description of a computer program package that uses these ideas, along with some illustrative examples are given.

Published in:

Audio and Electroacoustics, IEEE Transactions on  (Volume:21 ,  Issue: 5 )