Graphical explanation for the speed of the Fast Fourier Transform
classification
🧮 math.HO
keywords
fourierspeedtransformadvantagealgorithmbasisbit-reversalburden
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.