Word fft - Wiki



ca

cs

da

de

el

en

es

fi

fr

he

it

ja

ko

nl

pl

pt

ru

sh

sr

sv

tr

vi

zh

Translation Rhymes Wiki Map

ft.
fft
ft
ftt
ft²
fftt
ft

fft (English)

Wiki



FFT may refer to

A fast Fourier transform (FFT) is an algorithm to compute the discrete Fourier transform (DFT) and its inverse. Fourier analysis converts time (or space) to frequency and vice versa; an FFT rapidly computes such transformations by factorizing the DFT matrix into a product of sparse (mostly zero) factors. As a result, fast Fourier transforms are widely used for many applications in engineering, science, and mathematics. The basic ideas were popularized in 1965, but some FFTs had been previously known as early as 1805. Fast Fourier transforms have been described as "the most important numerical algorithm of our lifetime".

Wikipedia.org


-