comparison fft/fftw/fftw-3.3.4/README @ 19:26056e866c29

Add FFTW to comparison table
author Chris Cannam
date Tue, 06 Oct 2015 13:08:39 +0100
parents
children
comparison
equal deleted inserted replaced
18:8db794ca3e0b 19:26056e866c29
1 FFTW is a free collection of fast C routines for computing the
2 Discrete Fourier Transform in one or more dimensions. It includes
3 complex, real, symmetric, and parallel transforms, and can handle
4 arbitrary array sizes efficiently. FFTW is typically faster than
5 other publically-available FFT implementations, and is even
6 competitive with vendor-tuned libraries. (See our web page
7 http://fftw.org/ for extensive benchmarks.) To achieve this
8 performance, FFTW uses novel code-generation and runtime
9 self-optimization techniques (along with many other tricks).
10
11 The doc/ directory contains the manual in texinfo, PDF, info, and HTML
12 formats. Frequently asked questions and answers can be found in the
13 doc/FAQ/ directory in ASCII and HTML.
14
15 For a quick introduction to calling FFTW, see the "Tutorial" section
16 of the manual.
17
18 INSTALLATION
19 ------------
20
21 If you have downloaded an official release, please read chapter
22 10 "Installation and Customization" of the manual. In short:
23
24 ./configure
25 make
26 make install
27
28 If you are using the git repository, install ocaml, autoconf,
29 automake, and libtool, and execute the bootstrap.sh script. Most of
30 the source code of fftw is generated automatically, and this script
31 generates all the required source files.
32
33
34 CONTACTS
35 --------
36
37 FFTW was written by Matteo Frigo and Steven G. Johnson. You can
38 contact them at fftw@fftw.org. The latest version of FFTW,
39 benchmarks, links, and other information can be found at the FFTW home
40 page (http://www.fftw.org). You can also sign up to the fftw-announce
41 Google group to receive (infrequent) updates and information about new
42 releases.