FFTW

Abstract

FFTW is a free 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).

Cost

Freely available

DateOfInformation

Mon May 24 10:33:20 1999

Deployment Status

http://www.nhse.org/rib/repositories/ncsa_teamA_deployment/catalog/grid.html

Domain

Numerical Programs and Routines!Miscellaneous

Language

C

Name

FFTW

Restrictions

http://theory.lcs.mit.edu/~fftw/doc/fftw_8.html

Version

2.1.2

Webpage

http://theory.lcs.mit.edu/~fftw/

ContactIs

FFTW Feedback

Author(s)

Matteo Frigo
Steven Johnson

Contact teama@nhse.org with questions or comments regarding this page. Last updated For more information on NSF's PACI program see http://www.cise.nsf.gov/acir/ and http://www.npaci.edu/online/ All rights reserved. Do not copy or redistribute in any form. NCSA Access ©1998 Board of Trustees of the University of Illinois.