Graphical explanation for the speed of the Fast Fourier Transform

Details Graphical explanation for the speed of the Fast Fourier Transform Graphical explanation for the speed of the Fast Fourier Transform

2003-02-18

arxiv.org/abs/math/0302212v1

Mathematics

History and Overview

3 pages, 1 figure

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Graphical explanation for the speed of the Fast Fourier Transform does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graphical explanation for the speed of the Fast Fourier Transform, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graphical explanation for the speed of the Fast Fourier Transform will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-502038