FFT Filters are FIR filters implemented similarly to FIR Filter, which the exception that convolution is computed in the frequency domain instead that in the time domain, and for this reason they are usually faster to execute.The overlap/add method is applied.
From "The Scientist and Engineer's Guide to Digital Signal Processing", By Steven W. Smith, Ph.D.
"FFT convolution uses the overlap-add method together with the Fast Fourier Transform, allowing signals to be convolved by multiplying their frequency spectra. For filter kernels longer than about 64 points, FFT convolution is faster than standard convolution, while producing exactly the same result."
Created with the Personal Edition of HelpNDoc: Full featured EPub generator