| |
-
overview
 Fast Fourier Transform @ Mathworld
The fast Fourier transform (FFT) is a discrete Fourier transform algorithm which reduces the number of computations needed for points from to , where lg is the base-2 logarithm.
If the function to be transformed is not harmonically related to the sampling frequency, the response of an FFT looks like a sinc function (although the integrated power is still correct). Aliasing (leakage) can be reduced by apodization using a tapering function....
preview:
http://mathworld.wolfram.com/FastFourierTransform.html
12/12/2008
Tags: fft
 |
