Inside Collection (Course): Digital Signal Processing: A User's Guide
Summary: FFTs of length equal to a power of two are by far the most commonly used. Radix-2 decimation-in-time and decimation-in-frequency algorithms are the simplest power-of-two algorithms. Radix-4 and higher-radix algorithms require somewhat fewer complex multiplications but the same number of complex additions. The split-radix algorithm requires fewer complex multiplies than other power-of-two algorithms.
Derivation of the Fourier Transform
Fast Fourier Transform (FFT)
Spectrum Analyzer: Introduction to Fast Fourier Transform
Alternate FFT Structures
Decimation-in-Time (DIT) Radix-2 FFT
Decimation-in-Frequency
Efficient FFT Algorithm and Programming Tricks
FFTs of Prime Length and Rader's Conversion
Overview of Fast Fourier Transform Algorithms
Radix-4 FFT Algorithms
Running FFT
Split-radix FFT Algorithm
FFTs of length
The efficiency of an FFT implementation depends on more than just the number of computations. Efficient FFT programming tricks can make up to a several-fold difference in the run-time of FFT programs. Alternate FFT structures can lead to a more convenient data flow for certain hardware. As discussed in choosing the best FFT algorithm, certain hardware is designed for, and thus most efficient for, FFTs of specific lengths or radices.