By Topic

Minimax design of recursive digital filters with a lattice denominator

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 $31
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)
Lee, J.-H. ; Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan ; Ku, S.-Y.

The authors deal with the problem of minimax recursive digital filter design with a lattice structure for the denominator. The design problem is formulated so that the coefficients for the numerator and denominator of a recursive filter can be found by solving the best linear complex Chebyshev approximation (LCCA). A design technique based on the weighted least-squares algorithm previously proposed by one of the authors is then developed for solving the resulting LCCA problem. During the design process, this technique finds the tap coefficients for the numerator and the reflection coefficients for the denominator simultaneously. The stability of the designed recursive filter is ensured by incorporating an efficient stabilisation procedure to make all of the reflection coefficient values fall between -1 and +1. Computer simulations show that the proposed technique provides better design results than existing techniques

Published in:

Vision, Image and Signal Processing, IEE Proceedings -  (Volume:143 ,  Issue: 6 )