This method (and the general idea of an FFT) was popularized by a publication of Cooley and Tukey in 1965, but it was later discovered that those two authors had independently re-invented an algorithm known to Carl Friedrich Gauss around 1805 (and subsequently rediscovered several times in limited forms). As a result, it manages to reduce the complexity of computing the DFT from O ( N 2 ) multiplications by complex roots of unity traditionally called twiddle factors (after Gentleman and Sande, 1966 ). An FFT rapidly computes such transformations by factorizing the DFT matrix into a product of sparse (mostly zero) factors.
This operation is useful in many fields, but computing it directly from the definition is often too slow to be practical. The DFT is obtained by decomposing a sequence of values into components of different frequencies.
Fourier analysis converts a signal from its original domain (often time or space) to a representation in the frequency domain and vice versa. A discrete Fourier analysis of a sum of cosine waves at 10, 20, 30, 40, and 50 HzĪ fast Fourier transform ( FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT).
0 kommentar(er)
