Check out my first novel, midnight's simulacra!

Cooley-Tukey Algorithm

From dankwiki
Revision as of 13:04, 13 March 2013 by Dank (talk | contribs) (Created page with "This most well-known of FFT algorithms recursively breaks the DFT of N<sub>1</sub>N<sub>2</sub> into DFTs of N<sub>1</sub> and N<sub>2</sub>, approaching O(NlogN) for smooth (...")
(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.

Retrieved from "https://nick-black.com/dankwiki/index.php?title=Cooley-Tukey_Algorithm&oldid=5244"