Fast Fourier Transform
Fast Fourier Transform is a divide-and-conquer algorithm that efficiently computes the discrete Fourier transform of a sequence by recursively decomposing the problem into smaller subproblems, thereby reducing the computational complexity from quadratic to linearithmic order.
7.6K
Publications
472.7K
Citations
19K
Authors
3.8K
Institutions
Publications per year
2017–2026
1.5K
7.6K
The Design and Implementation of FFTW3
Matteo Frigo, Steven G. Johnson · Proceedings of the IEEE · 2005 · 5.2K citations
1–5 of 7.6K
19K
33
h-index
18
h-index
17
h-index
17
h-index
IBM Research - Thomas J. Watson Research Center, United States
18 publications · 3.1K citations
16
h-index
1–5 of 19K
3.8K
Massachusetts Institute of Technology
Cambridge, United States
48 h-index
146 publications
20.3K citations
University of Illinois Urbana-Champaign
Urbana, United States
40 h-index
167 publications
19.6K citations

Centre National de la Recherche Scientifique
Paris, France
36 h-index
225 publications
8.7K citations
Duke University
Durham, United States
35 h-index
175 publications
10K citations
Stanford University
Stanford, United States
34 h-index
83 publications
14.1K citations
Tsinghua University
Beijing, China
33 h-index
165 publications
14.7K citations

Chinese Academy of Sciences
Beijing, China
31 h-index
265 publications
10.6K citations
University of California, Berkeley
Berkeley, United States
30 h-index
124 publications
7.6K citations
1–8 of 3.8K
175 publications · 13.3K citations
53
h-index
115 publications · 9.3K citations
47
h-index
118 publications · 6K citations
43
h-index
72 publications · 4.4K citations
40
h-index
90 publications · 5.3K citations
37
h-index
1–5