Mixed-Radix Cooley-Tukey FFT

When the desired DFT length
can be expressed as a product of
smaller integers, the Cooley-Tukey decomposition provides what is
called a *mixed radix* Cooley-Tukey FFT algorithm.
^{A.2}

Two basic varieties of Cooley-Tukey FFT are *decimation in time*
(DIT) and its Fourier dual, *decimation in frequency* (DIF). The
next section illustrates decimation in time.

[How to cite this work] [Order a printed hardcopy] [Comment on this page via email]

Copyright ©

Center for Computer Research in Music and Acoustics (CCRMA), Stanford University