fast fourier transform

F f

Transcription

- US Pronunciation
- US IPA

- US Pronunciation
- US IPA

Definitions of fast fourier transform words

noun Technical meaning of fast fourier transform (algorithm) (FFT) An algorithm for computing the Fourier transform of a set of discrete data values. Given a finite set of data points, for example a periodic sampling taken from a real-world signal, the FFT expresses the data in terms of its component frequencies. It also solves the essentially identical inverse problem of reconstructing a signal from the frequency data. The FFT is a mainstay of numerical analysis. Gilbert Strang described it as "the most important algorithm of our generation". The FFT also provides the asymptotically fastest known algorithm for multiplying two polynomials. Versions of the algorithm (in C and Fortran) can be found on-line from the GAMS server here. 1
noun fast fourier transform A member of a certain family of algorithms for efficiently computing the discrete Fourier transform of data. 0
noun fast fourier transform An instance of performing one of these algorithms. 0

See all 3 definitions of fast fourier transform

Information block about the term

Parts of speech for Fast fourier transform

noun

adjective

verb

adverb

pronoun

preposition

conjunction

determiner

exclamation

Full grammatical hierarchy of Fast fourier transform

See also

Matching words

Was this page helpful?

Yes No

Thank you for your feedback! Tell your friends about this page

Tell us why?