FFTW
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: Software/Hardware Requirements:
|
Other Links:
Mailing Lists/USENET News Groups: User Comments:
See A Screen Shot? (N/A)
|