d@0: d@0: d@0: Tutorial - FFTW 3.2.1 d@0: d@0: d@0: d@0: d@0: d@0: d@0: d@0: d@0: d@0: d@0: d@0: d@0:
d@0:

d@0: d@0: Next: , d@0: Previous: Introduction, d@0: Up: Top d@0:

d@0:
d@0: d@0:

2 Tutorial

d@0: d@0: d@0: d@0:

This chapter describes the basic usage of FFTW, i.e., how to compute d@0: the Fourier transform of a single array. This chapter tells the d@0: truth, but not the whole truth. Specifically, FFTW implements d@0: additional routines and flags that are not documented here, although d@0: in many cases we try to indicate where added capabilities exist. For d@0: more complete information, see FFTW Reference. (Note that you d@0: need to compile and install FFTW before you can use it in a program. d@0: For the details of the installation, see Installation and Customization.) d@0: d@0:

We recommend that you read this tutorial in order.1 At the least, read the first section (see Complex One-Dimensional DFTs) before reading any of the others, even if your d@0: main interest lies in one of the other transform types. d@0: d@0:

Users of FFTW version 2 and earlier may also want to read Upgrading from FFTW version 2. d@0: d@0: d@0:

d@0:
d@0:

Footnotes

[1] You can d@0: read the tutorial in bit-reversed order after computing your first d@0: transform.

d@0: d@0:

d@0: d@0: d@0: