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.
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.
More From encyclopedia.com
transform , trans·form / transˈfôrm/ • v. [tr.] make a thorough or dramatic change in the form, appearance, or character of: lasers have transformed cardiac surg… Fourier Analysis , Fourier transform A mathematical operation that analyzes an arbitrary waveform into its constituent sinusoids (of different frequencies and amplitude… transform fault , transform fault A type of strike-slip fault in an ocean, occurring at the boundaries of lithospheric plates, in which the direction of movement of th… Colin Munro Macleod , MacLeod, Colin Munro
MACLEOD, COLIN MUNRO
microbiology, medicine.
The son of a Presbyterian minister. MacLeod spent his youth in Canada, where the fa… a fast reader. , fast1 / fast/ • adj. 1. moving or capable of moving at high speed. ∎ performed or taking place at high speed; taking only a short time: the journey w… Transformer , A transformer is an electrical device that changes, or transforms, an alternating current (AC) signal from one level to another. The device typically…
About this article
fast Fourier transform
All Sources -
You Might Also Like
NEARBY TERMS
fast Fourier transform