Fast Fourier transform

Rare card · No. 34980

A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT), or its inverse (IDFT), of a sequence. A Fourier transform converts a signal from its original domain (often time or space) to a representation in the frequency domain and vice versa. The DFT is obtained by decomposing a sequence of values into components of different frequencies. This operation is useful in many fields, but computing it directly from the definition is often too slow to be practical. An FFT rapidly computes such transformations by factorizing the DFT matrix into a product of sparse (mostly zero) factors. As a result, it manages to reduce the complexity of computing the DFT from O ( n 2 ) {\textstyle O(n^{2})} , which arises if one simply applies the definition of DFT, to O ( n log ⁡ n...

Read on Wikipedia · Image Yangwenbo99, CC BY-SA 4.0