By Topic

Low-pass filters realizable as all-pass sums: design via a new flat delay filter

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)
I. W. Selesnick ; Dept. of Electr. Eng., Polytech. Univ., Brooklyn, NY, USA

This paper describes a new class of maximally flat low-pass recursive digital filters. The filters are realizable as a parallel sum of two all-pass filters, a structure for which low-complexity low-noise implementations exist. Note that, with the classical Butterworth filter of degree N which is retrieved as a special case, it is not possible to adjust the delay (or phase linearity). However, with the more general class of filters described in this paper, the adjustment of the delay becomes possible, and the tradeoff between the delay and the phase linearity can be chosen. The construction of these low-pass filters depends upon a new maximally flat delay all-pole filter, for which the degrees of flatness at ω=0 and ω=π are not necessarily equal. For the coefficients of this flat delay filter, an explicit solution is introduced, which also specializes to a previously known result

Published in:

IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing  (Volume:46 ,  Issue: 1 )