Fast Fourier Transform

From Hydrogenaudio Knowledgebase
Revision as of 12:49, 22 March 2005 by Jan (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Fast Fourier Transform is an efficient algorithm for calculating the discrete fourier transform (DFT). Reduces the execution time by hundreds in some cases. Whereas DFT takes an order of o(n²) computations, FFT takes an order of o(n lg n), and is definitely the preferred algorithm to used in all applications. The disadvantage of the FFT is that the number of samples must be exactly a power of 2.