cannam@95: FFTW is a free collection of fast C routines for computing the
cannam@95: Discrete Fourier Transform in one or more dimensions.  It includes
cannam@95: complex, real, symmetric, and parallel transforms, and can handle
cannam@95: arbitrary array sizes efficiently.  FFTW is typically faster than
cannam@95: other publically-available FFT implementations, and is even
cannam@95: competitive with vendor-tuned libraries.  (See our web page for
cannam@95: extensive benchmarks.)  To achieve this performance, FFTW uses novel
cannam@95: code-generation and runtime self-optimization techniques (along with
cannam@95: many other tricks).
cannam@95: 
cannam@95: The doc/ directory contains the manual in texinfo, PDF, info, and HTML
cannam@95: formats.  Frequently asked questions and answers can be found in the
cannam@95: doc/FAQ/ directory in ASCII and HTML.
cannam@95: 
cannam@95: For a quick introduction to calling FFTW, see the "Tutorial" section
cannam@95: of the manual.
cannam@95: 
cannam@95: Installation instructions are provided in the manual (don't worry, it
cannam@95: is straightforward).
cannam@95: 
cannam@95: CONTACTS
cannam@95: --------
cannam@95: 
cannam@95: FFTW was written by Matteo Frigo and Steven G. Johnson.  You can
cannam@95: contact them at fftw@fftw.org.  The latest version of FFTW,
cannam@95: benchmarks, links, and other information can be found at the FFTW home
cannam@95: page (http://www.fftw.org).  You can also sign up to the fftw-announce
cannam@95: mailing list to receive (infrequent) updates and information about new
cannam@95: releases; to do so, go to:
cannam@95: 
cannam@95: 	http://www.fftw.org/mailman/listinfo/fftw-announce