Fast Fourier Transform: Difference between revisions

From Hydrogenaudio Knowledgebase
No edit summary
No edit summary
Line 5: Line 5:




[[Category:Technical]]
[[Category:Digital Signal Processing]]

Revision as of 22:44, 7 September 2006


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 computations, FFT takes an order of , and is definitely the preferred algorithm to used in all applications. The FFT in most implementations consistent of samples that are exactly a power of 2.