| |
-
overview
 Fast Fourier transform @ Wikipedia
A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse.
There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex-number arithmetic to group theory and number theory; this article gives an overview of the available techniques and some of their general properties, while the specific algorithms are described in subsidiary articles linked...
preview:
http://en.wikipedia.org/wiki/Fast_Fourier_transform
12/12/2008
Tags: fft
 |
