DocumentCode :
1081565
Title :
Digital filters with poles via the FFT
Author :
Read, Randol ; Meek, Jethro
Author_Institution :
Amoco Research Center, Tulsa, Okla
Volume :
19
Issue :
4
fYear :
1971
fDate :
12/1/1971 12:00:00 AM
Firstpage :
322
Lastpage :
323
Abstract :
A method is presented that uses the fast Fourier transform (FFT) to compute the output of an infinite-impulse-response digital filter. This method uses the summability of infinite-length geometric sequences to account for the aliasing that is inherent in using the discrete Fourier transform (DFT) to calculate convolutions. Previous procedures that use the FFT to realize recursive digital filters require that the filter have a large number of poles and zeros before the FFT method offers a computational advantage over the direct implementation of the filter. The technique presented here is competitive with direct filter implementation.
Keywords :
Arithmetic; Computational Intelligence Society; Digital filters; Discrete Fourier transforms; Equations; Fast Fourier transforms; Feedback; High-speed electronics; IIR filters; Poles and zeros;
fLanguage :
English
Journal_Title :
Audio and Electroacoustics, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9278
Type :
jour
DOI :
10.1109/TAU.1971.1162195
Filename :
1162195
Link To Document :
بازگشت