Check out my first novel, midnight's simulacra!
Cooley-Tukey Algorithm: Difference between revisions
From dankwiki
(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 (...") |
No edit summary |
||
| Line 1: | Line 1: | ||
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 (highly composite) numbers. | 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 (highly composite) numbers. | ||
[[CATEGORY: Computer Science Eponyms]] | |||
Latest revision as of 13:11, 13 March 2013
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.
