fast Fourier transform
fast Fourier transform (FFT) An algorithm (e.g. the Cooley—Tukey method) which enables the Fourier transformation of digitized waveforms 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
Pick a style below, and copy the text for your bibliography.

MLA

Chicago

APA
"fast Fourier transform." A Dictionary of Earth Sciences. . Encyclopedia.com. 24 Oct. 2017 <http://www.encyclopedia.com>.
"fast Fourier transform." A Dictionary of Earth Sciences. . Encyclopedia.com. (October 24, 2017). http://www.encyclopedia.com/science/dictionariesthesaurusespicturesandpressreleases/fastfouriertransform
"fast Fourier transform." A Dictionary of Earth Sciences. . Retrieved October 24, 2017 from Encyclopedia.com: http://www.encyclopedia.com/science/dictionariesthesaurusespicturesandpressreleases/fastfouriertransform
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
Pick a style below, and copy the text for your bibliography.

MLA

Chicago

APA
"fast Fourier transform." A Dictionary of Computing. . Encyclopedia.com. 24 Oct. 2017 <http://www.encyclopedia.com>.
"fast Fourier transform." A Dictionary of Computing. . Encyclopedia.com. (October 24, 2017). http://www.encyclopedia.com/computing/dictionariesthesaurusespicturesandpressreleases/fastfouriertransform
"fast Fourier transform." A Dictionary of Computing. . Retrieved October 24, 2017 from Encyclopedia.com: http://www.encyclopedia.com/computing/dictionariesthesaurusespicturesandpressreleases/fastfouriertransform