Rader–Brenner algorithm (Discrete Fourier Transform Discrete Fourier Transform)

From Algorithm Wiki

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

1976

Reference

https://ieeexplore.ieee.org/document/1162805

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