Fast Fourier Transforms (FFT)

FFTs for Multiple Needs

FFT functions in one, two, or three dimensions with support for mixed radices (not limited to sizes that are powers of 2). Distributed versions of these FFT functions are used on clusters. Supported functions include:

  • One-dimensional versions in single and double precision
  • Multidimensional, complex-to-complex, real-to-complex, and real-to-real transforms of arbitrary length
  • FFTW interfaces for compatibility with industry-standard APIs

Fourier Transform Functions for Clusters

When single-node performance is insufficient, get support for distributed computation across a cluster of compute nodes.


See below for further notes and disclaimers.1


FFT Performance Boost Benchmark

Make informed decisions regarding which functions to use in your applications, comparing the performance of Intel® Math Kernel Library to FFTW.

Additional Features

Intel’s compilers may or may not optimize to the same degree for non-Intel microprocessors for optimizations that are not unique to Intel microprocessors. These optimizations include SSE2, SSE3, and SSSE3 instruction sets and other optimizations. Intel does not guarantee the availability, functionality, or effectiveness of any optimization on microprocessors not manufactured by Intel. Microprocessor-dependent optimizations in this product are intended for use with Intel microprocessors. Certain optimizations not specific to Intel microarchitecture are reserved for Intel microprocessors. Please refer to the applicable product User and Reference Guides for more information regarding the specific instruction sets covered by this notice. Notice revision #20110804