DocumentCode
1176821
Title
Fast generation of universal maximally flat FIR filters
Author
Samadi, Saed ; Ahmad, M. Omair ; Swamy, M.N.S.
Author_Institution
Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que., Canada
Volume
50
Issue
3
fYear
2003
fDate
3/1/2003 12:00:00 AM
Firstpage
441
Lastpage
444
Abstract
The relation for impulse response coefficients of Baher´s universal maximally flat filters is a threefold summation formula. The summand involves four binomial coefficients whose computation requires an extensive number of additions and multiplications. There are three main parameters that characterize the filters, the order N, the number of zeros K, and the group delay parameter d. With fixed values for these parameters, the total number of additions, multiplications, and divisions required to compute the impulse response coefficients hk are of the orders O(N4), O(N5) and O(N4), respectively. We present a recurrence for the computation of hk for all possible values of K under fixed values for N and d. The recurrence provides speedups of the orders O(N2), O(N3) and O(N2) for the number of additions, multiplications and divisions, respectively.
Keywords
FIR filters; bifurcation; computational complexity; digital filters; poles and zeros; transient response; Baher´s filters; binomial coefficients; group delay parameter; impulse response coefficients; recurrence; summation formula; universal maximally flat FIR filters; Application software; Circuits; Computational complexity; Councils; Delay; Digital filters; Digital signal processing; Finite impulse response filter;
fLanguage
English
Journal_Title
Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on
Publisher
ieee
ISSN
1057-7122
Type
jour
DOI
10.1109/TCSI.2003.808858
Filename
1193025
Link To Document