This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
FFT Length in Digital Filtering
August 1979 (vol. 28 no. 8)
pp. 577-580
A.R. Butz, Department of Electrical Engineering, Northwestern University
When the FFT is employed for nonrecursive digital filtering, the time required to process one block of input data, N samples long, is often approximately of the form N(logr (N) + Q), where Q = 0. Earlier results on determining optimum N have assued Q =0, becauese it has long been informally observed that typically little is to be gained by taking the value of Q > 0 into account, and because the assumption that Q = 0 permits determination of N without reference to machine dependent parameters
Index Terms:
nonrecursive filtering, Convolution, correlation, FFT
Citation:
A.R. Butz, "FFT Length in Digital Filtering," IEEE Transactions on Computers, vol. 28, no. 8, pp. 577-580, Aug. 1979, doi:10.1109/TC.1979.1675414
Usage of this product signifies your acceptance of the Terms of Use.