Graphical explanation for the speed of the Fast Fourier Transform
Randall D. Peters
math.HOarXiv:math/0302212
Abstract
For a sample set of 1024 values, the FFT is 102.4 times faster than the discrete Fourier transform (DFT). The basis for this remarkable speed advantage is the `bit-reversal' scheme of the Cooley-Tukey algorithm. Eliminating the burden of `degeneracy' by this means is readily understood using vector graphics.
Create a lesson
Related papers
Chebyshev and garment cutting. Debunking some myths
Victor Tapia
The suppression thesis in Riemann's Habilitationsvortrag
Victor Tapia
Remembering Solomon Marcus
Florin Nichita
The Erdős--Sós Theorem
David R. Wood
Math for AI safety: an invitation for mathematicians
Lionel Levine
Immensely Questionable Tests
Siyona Agarwal, Julian Bernhoft, Karam Gill et al.