Fast Fourier Transform

From Hydrogenaudio Knowledgebase
Revision as of 12:45, 18 August 2023 by Korth (talk | contribs) (Removed anonymous edits made March/April 2022 from a particular range of IP addresses)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Fast Fourier transform (FFT) is an efficient algorithm for calculating the discrete Fourier transform (DFT). The FFT produces the same results as a DFT but it 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 be used in all applications in terms of computational complexity. The FFT in most implementations consistent of samples that are exactly a power of 2, this is commonly known as a FFT Radix 2 algorithm where etc.

External links