Cooley–Tukey algorithm (Discrete Fourier Transform Discrete Fourier Transform)

From Algorithm Wiki

Revision as of 09:30, 28 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n \log n)$

Space Complexity

$O(n)$? words

(Computes and keeps track of DFTs for recursive subcases)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

1965

Reference

https://www.ams.org/journals/mcom/1965-19-090/S0025-5718-1965-0178586-1/S0025-5718-1965-0178586-1.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Cooley–Tukey_algorithm_(Discrete_Fourier_Transform_Discrete_Fourier_Transform)&oldid=47819"