cannam@95: cannam@95: cannam@95: Tutorial - FFTW 3.3.3 cannam@95: cannam@95: cannam@95: cannam@95: cannam@95: cannam@95: cannam@95: cannam@95: cannam@95: cannam@95: cannam@95: cannam@95: cannam@95:
cannam@95: cannam@95:

cannam@95: Next: , cannam@95: Previous: Introduction, cannam@95: Up: Top cannam@95:

cannam@95:
cannam@95: cannam@95:

2 Tutorial

cannam@95: cannam@95: cannam@95: cannam@95:

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

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 cannam@95: main interest lies in one of the other transform types. cannam@95: cannam@95:

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

cannam@95:
cannam@95:

Footnotes

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

cannam@95: cannam@95:
cannam@95: cannam@95: cannam@95: