======================
Fast Fourier Transform
======================
:doc:`/WorkProcessClassifiers/GlobalAlgorithm/index`

*Fast Fourier Transform* algorithm computes the discrete Fourier transform (DFT) and its inverse efficiently. For details refer to the online documentation `http://en.wikipedia.org/wiki/Fast_Fourier_transform <http://en.wikipedia.org/wiki/Fast_Fourier_transform>`__.

.. rubric:: Tool Support

* :doc:`/Tools/MatlabTool/index`

  For details refer to the online documentation of the function  `'fft' <http://www.mathworks.de/de/help/matlab/ref/fft.html>`__.

.. rubric:: Single Steps using the Algorithm

* :doc:`/DataPreprocessing/DataCleaning/DataDenoising/DataDenoisingWithFastFourierFilter/index`

.. rubric:: References

- J.W.\  Cooley and J.W. Tukey, An Algorithm for the Machine Computation of the Complex Fourier Series, Mathematics of Computation, vol. 19, pp. 297-301, 1965.

- P.\  Duhamel and M. Vetterli, Fast Fourier Transforms: A Tutorial Review and a State of the Art, Signal Processing, vol. 19, pp. 259-299, 1990.