Next Generation FFT Algorithms in Theory and Practice: Parallel Implementations and Applications
The fast Fourier Transform (FFT) is an algorithm used in a wide variety of applications, yet does not make optimal use of many current hardware platforms. Hardware utilization performance on its own does not however imply optimal problem solving. The purpose of this minisymposium is to enable exchange of information between people working on alternative FFT algorithms, to those working on FFT implementations, in particular for parallel hardware.
|Daisuke Takahashi||University of Tsukuba, Japan||Slides|
|Franz Fanchetti||Carnegie Mellon University, USA||Slides|
|Samar Aseeri||King Abdullah University of Science and Technology (KAUST), Saudi Arabia||Slides|
|Doru Thom Popovici||Lawrence Berkeley National Laboraory, USA||Slides|