Graphical explanation for the speed of the Fast Fourier Transform

Simple item page
dc.creatorPeters, Randall D.
dc.date2003-02-18
dc.date.accessioned2026-07-07T04:55:23Z
dc.date.available2026-07-07T04:55:23Z
dc.descriptionFor 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.
dc.description3 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/math/0302212
dc.identifierhttp://arxiv.org/abs/math/0302212
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/66558
dc.subjectHistory and Overview
dc.titleGraphical explanation for the speed of the Fast Fourier Transform
dc.typetext

Files

Collections

arXiv