Parallel Fast Fourier Transforms is a computational method that enables the efficient execution of Fast Fourier Transform operations through decomposition and concurrent processing across multiple processing units to accelerate large-scale numerical computations.
208
Publications
8.7K
Citations
511
Authors
237
Institutions
Publications per year
2017–2026
26
Variants
Parallel FftParallel Ffts
Parents
Publications
208
BSPlib: The BSP programming library
Jonathan M. D. Hill, Bill McColl, Dan Ştefănescu et al. · Parallel Computing · 1998 · 319 citations · Full text
1–5 of 208
Authors
511
- KK
5
h-index
- DT
5
h-index
- MA
4
h-index
- MG
4
h-index
- MZ
3
h-index
1–5 of 511
Institutions
237
University of Minnesota
Minneapolis, United States
8 h-index
17 publications
1.2K citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
4 h-index
10 publications
285 citations
University of Tsukuba
Tsukuba, Japan
4 h-index
4 publications
68 citations
University of Toronto
Toronto, Canada
4 h-index
5 publications
128 citations
Queen's University Belfast
Belfast, United Kingdom
4 h-index
10 publications
610 citations
California Institute of Technology
Pasadena, United States
3 h-index
3 publications
124 citations
National Central University
Taoyuan City, Taiwan
3 h-index
9 publications
219 citations
NSF National Center for Atmospheric Research
Boulder, United States
3 h-index
6 publications
99 citations
1–8 of 237
Venues
- Parallel Computing
12 publications · 695 citations
12
h-index
- IEEE Transactions on Computers
10 publications · 506 citations
10
h-index
- Computer Physics Communications
7 publications · 264 citations
7
h-index
- IEEE Transactions on Circuits & Systems II Express Briefs
6 publications · 184 citations
6
h-index
- SIAM Journal on Scientific Computing
5 publications · 491 citations
5
h-index
1–5