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