By Topic

Recursive digital filters with maximally flat group delay

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)

A well-known limitation of the recursive digital filter, when compared to the nonrecursive filter, is its incapability of having a strictly linear phase characteristic; thus it may only approximate a constant group delay. For the analog filters the choice of the maximally flat criterion leads to the use of the Bessel polynomials. Yet digital approximations of these continuous filter functions are inadequate to yield the true maximally flat delay approximation of the recursive filters. Our purpose is to provide for the problem at hand a solution obtained by a direct approximation procedure in the z plane. The denominator of the transfer function turns out to be a Gaussian hypergeometric function, more particularly connected with the Legendre functions. The stability of the filters is discussed and some numerical results in regard to the amplitude and phase responses as well as the pole loci are given.

Published in:

IEEE Transactions on Circuit Theory  (Volume:18 ,  Issue: 6 )