Graphical explanation for the speed of the Fast Fourier Transform

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
3 pages, 1 figure

Keywords

History and Overview

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/66558

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0302212
 http://arxiv.org/abs/math/0302212

Collections

arXiv