fft

F f

Definitions of fft word

abbreviation Technical meaning of FFT Fast Fourier Transform 3
noun Definition of fft in Technology (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

adjective

verb

adverb

pronoun

preposition

conjunction

determiner

exclamation

Was this page helpful?

Yes No

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

Tell us why?