Revision as of 00:15, 10 June 2003 edit Stevenj (talk \| contribs) Extended confirmed users 14,849 edits clarifications ← Previous edit		Revision as of 00:17, 10 June 2003 edit undo Stevenj (talk \| contribs) Extended confirmed users 14,849 edits No edit summary Next edit →
Line 1: '''Rader's ~~FFT~~ algorithm''' is a [[Fast Fourier Transform]] (FFT) algorithm that computes the [[discrete Fourier transform]] (DFT) of [[prime]] sizes by re-expressing the DFT as a cyclic [[convolution]]. (The other algorithm for FFTs of prime sizes, [[Bluestein's FFT algorithm\|Bluestein's algorithm]], also works by rewriting the DFT as a convolution.) Recall that the DFT is defined by the formula

Rader's FFT algorithm: Difference between revisions