Check out my first novel, midnight's simulacra!

Cooley-Tukey Algorithm

From dankwiki
Revision as of 13:11, 13 March 2013 by Dank (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

This most well-known of FFT algorithms recursively breaks the DFT of N1N2 into DFTs of N1 and N2, approaching O(NlogN) for smooth (highly composite) numbers.