FFTW is a comprehensive collection of fast C routines for computing the Discrete Fourier Transform (DFT) and various special cases thereof. It is an open-source implementation of the Fast Fourier transform algorithm. It can compute transforms of real and complex-values arrays of arbitrary size and dimension. AMD FFTW includes selective kernels and routines optimized for the AMD EPYCTM processor family.
Highlights of AMD FFTW 2.2
- Improved performance of in-place MPI FFT by employing a faster in-place MPI transpose routine.
- Improved performance of copy function cpy2d_pair used for rank-0 transform and buffering plans.
- Added DFT kernels of higher radix sizes for q1fv, t1fv and q1fv FFT codelets.
The package containing AMD FFTW Library binaries which includes optimizations for the AMD EPYCTM processor family and documentation are available in the Downloads section below.
Source code is available on GitHub https://github.com/amd/amd-fftw.
Refer here for older versions.