1FFTW is a free collection of fast C routines for computing the
2Discrete Fourier Transform in one or more dimensions. It includes
3complex, real, symmetric, and parallel transforms, and can handle
4arbitrary array sizes efficiently. FFTW is typically faster than
5other publically-available FFT implementations, and is even
6competitive with vendor-tuned libraries. (See our web page
7http://fftw.org/ for extensive benchmarks.) To achieve this
8performance, FFTW uses novel code-generation and runtime
9self-optimization techniques (along with many other tricks).
11The doc/ directory contains the manual in texinfo, PDF, info, and HTML
12formats. Frequently asked questions and answers can be found in the
13doc/FAQ/ directory in ASCII and HTML.
15For a quick introduction to calling FFTW, see the "Tutorial" section
16of the manual.
21INSTALLATION FROM AN OFFICIAL RELEASE:
23Please read chapter 10 "Installation and Customization" of the manual.
28 make install
30INSTALLATION FROM THE GIT REPOSITORY:
32First, install these programs:
34 ocaml, ocamlbuild, autoconf, automake, indent, and libtool,
38 sh bootstrap.sh
41The bootstrap.sh script runs configure directly, but if you need to
42re-run configure, you must pass the --enable-maintainer-mode flag:
44 ./configure --enable-maintainer-mode [OTHER CONFIGURE FLAGS]
49FFTW was written by Matteo Frigo and Steven G. Johnson. You can
50contact them at firstname.lastname@example.org. The latest version of FFTW,
51benchmarks, links, and other information can be found at the FFTW home
52page (http://www.fftw.org). You can also sign up to the fftw-announce
53Google group to receive (infrequent) updates and information about new
1This is the official git repository for the FFTW library for computing
2Fourier transforms (version 3.x).