Mercurial > hg > sv-dependency-builds
comparison src/fftw-3.3.3/README @ 10:37bf6b4a2645
Add FFTW3
author | Chris Cannam |
---|---|
date | Wed, 20 Mar 2013 15:35:50 +0000 |
parents | |
children |
comparison
equal
deleted
inserted
replaced
9:c0fb53affa76 | 10:37bf6b4a2645 |
---|---|
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 for | |
7 extensive benchmarks.) To achieve this performance, FFTW uses novel | |
8 code-generation and runtime self-optimization techniques (along with | |
9 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 instructions are provided in the manual (don't worry, it | |
19 is straightforward). | |
20 | |
21 CONTACTS | |
22 -------- | |
23 | |
24 FFTW was written by Matteo Frigo and Steven G. Johnson. You can | |
25 contact them at fftw@fftw.org. The latest version of FFTW, | |
26 benchmarks, links, and other information can be found at the FFTW home | |
27 page (http://www.fftw.org). You can also sign up to the fftw-announce | |
28 mailing list to receive (infrequent) updates and information about new | |
29 releases; to do so, go to: | |
30 | |
31 http://www.fftw.org/mailman/listinfo/fftw-announce |