Bruun's FFT algorithm (Discrete Fourier Transform Discrete Fourier Transform)

From Algorithm Wiki

Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O(n)$? words (Computes O(n) remainders per stage; storage space can be reused across stages) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1978 == Reference == https://ieeexplore.ieee.org/document/1163036/")

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

Jump to navigation Jump to search

Time Complexity

$O(nlogn)$

Space Complexity

$O(n)$? words

(Computes O(n) remainders per stage; storage space can be reused across stages)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

1978

Reference

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Bruun%27s_FFT_algorithm_(Discrete_Fourier_Transform_Discrete_Fourier_Transform)&oldid=45319"