|
Search over 100 encyclopedias and dictionaries: |
Research categories | Follow us on Twitter |
Research categories
View all topics in the newsView all reference sources at Encyclopedia.com |
|||
fast Fourier transform
fast Fourier transform (FFT) An algorithm (e.g. the Cooley—Tukey method) which enables the Fourier transformation of digitized wave-forms to be accomplished more rapidly by computer than would be possible using direct evaluation of the Fourier integral. FFT usually involves iterative techniques. See also FOURIER ANALYSIS; and FOURIER TRANSFORM.
|
|
|
Cite this article
AILSA ALLABY and MICHAEL ALLABY. "fast Fourier transform." A Dictionary of Earth Sciences. 1999. Encyclopedia.com. 31 May. 2012 <http://www.encyclopedia.com>. AILSA ALLABY and MICHAEL ALLABY. "fast Fourier transform." A Dictionary of Earth Sciences. 1999. Encyclopedia.com. (May 31, 2012). http://www.encyclopedia.com/doc/1O13-fastFouriertransform.html AILSA ALLABY and MICHAEL ALLABY. "fast Fourier transform." A Dictionary of Earth Sciences. 1999. Retrieved May 31, 2012 from Encyclopedia.com: http://www.encyclopedia.com/doc/1O13-fastFouriertransform.html |
|
fast Fourier transform
fast Fourier transform (FFT) An algorithm that computes the discrete Fourier transform accurately and efficiently on digital computers. FFT techniques have wide applicability in linear systems, optics, probability theory, quantum physics, antennas, and signal analysis.
|
|
|
Cite this article
JOHN DAINTITH. "fast Fourier transform." A Dictionary of Computing. 2004. Encyclopedia.com. 31 May. 2012 <http://www.encyclopedia.com>. JOHN DAINTITH. "fast Fourier transform." A Dictionary of Computing. 2004. Encyclopedia.com. (May 31, 2012). http://www.encyclopedia.com/doc/1O11-fastFouriertransform.html JOHN DAINTITH. "fast Fourier transform." A Dictionary of Computing. 2004. Retrieved May 31, 2012 from Encyclopedia.com: http://www.encyclopedia.com/doc/1O11-fastFouriertransform.html |
|