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 mini-symposium is to enable the exchange of information between people working on alternative FFT algorithms, to those working on FFT implementations, in particular for parallel hardware. In addition to FFT algorithms, number-theoretical transform (NTT) is also included in the topic of this minisymposium.
| Speaker | Affiliation | Presentation |
|---|---|---|
| Daisuke Takahashi | University of Tsukuba, Japan | Slides |
| Sanil Rao | Carnegie Mellon University, USA | Slides |
| Samar Aseeri | King Abdullah University of Science and Technology (KAUST), Saudi Arabia | Slides |
| Miguel Ferrer Avila | NVIDIA, USA | Slides |