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 EPYC™ processor family.
Highlights of AMD FFTW 2.1
- Improved performance of the FFT kernels for AVX and AVX2
- Improved performance of copy function used in rank-0 transform and buffering plans
- Several build configuration updates that work with –enable-amd-opt option including long double and quad precision support, CFLAGS, AOCC/clang compiler support
The package containing AMD FFTW Library binaries which include optimizations for the AMD EPYC™ processor family and documentation are available in the Downloads section below.
Source code is available on GitHub https://github.com/amd/amd-fftw.