Bruun's FFT 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 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/