Icon FFTW is a collection of fast C routines for computing the Discrete Fourier Transform in one or more dimensions. It includes complex, real, and parallel transforms, and can handle arbitrary array sizes efficiently. FFTW is typically faster than other publicly-available FFT implementations, and is even competitive with vendor-tuned libraries. (See our web page for extensive benchmarks.) To achieve this performance, FFTW uses novel code-generation and runtime self-optimization techniques (along with many other tricks).

FFTW received the 1999 J. H. Wilkinson Prize for Numerical Software, which is awarded every four years to the software that "best addresses all phases of the preparation of high quality numerical software."

Current Version:   2.1.3

License Type:   GPL, non-free licenses also available from authors

Home Site:

Source Code Availability:


Available Binary Packages:

Targeted Platforms:

Any platform with C compiler.

Software/Hardware Requirements:

C compiler

Other Links:
eiffel-fftw (Eiffel interface to FFTW)

Mailing Lists/USENET News Groups:

There is a moderated mailing list called fftw-announce for news of updates to FFTW. To join, go to:

User Comments:

  • "It's the best FFT package I have ever seen."
  • "It performs my standard 256 iterations of 1024pt complex fft about 20 times faster than the previous one I used."
  • "I'm very glad to finally have a professional C fft-package to work with (leaving the fft swamp behind)."

See A Screen Shot? (N/A)

  SAL Home   |   Numerical Analysis   |   Misc

Comments? SAL@KachinaTech.COM
Copyright © 1995-2001 by Herng-Jeng Jou
Copyright © 1997-2001 by Kachina Technologies, Inc.
All rights reserved.