Rader's FFT Algorithm for Prime Lengths

Rader's FFT algorithm can be used to compute DFTs of length in operations when is a prime number. For an introduction, see the Wikipedia page for Rader's FFT Algorithm:

http://en.wikipedia.org/wiki/Rader's_FFT_algorithm

---

Previous: Prime Factor Algorithm (PFA)
Next: Bluestein's FFT Algorithm

Order a Hardcopy of Mathematics of the DFT

---

About the Author: Julius Orion Smith III
Julius Smith's background is in electrical engineering (BS Rice 1975, PhD Stanford 1983). He is presently Professor of Music and Associate Professor (by courtesy) of Electrical Engineering at Stanford's Center for Computer Research in Music and Acoustics (CCRMA), teaching courses and pursuing research related to signal processing applied to music and audio systems. See http://ccrma.stanford.edu/~jos/ for details.