About this document
Fast Fourier Transform Overview by xenightmare is a document available to read on EtoBox.
The document discusses the fast Fourier transform (FFT) algorithm. It begins by outlining the basic workings of the radix-2 decimation-in-time FFT algorithm. It then shows how the FFT provides significant computational savings over direct computation of the discrete Fourier transform (DFT) by reducing the operation count from O(N^2) to O(NlogN). Specifically, it decomposes the DFT into smaller DFTs using the Cooley-Tukey algorithm, represented via a signal flowgraph. This decomposition process is continued
- Author
- xenightmare
- Language
- EN