cannam@167: Next: Other Important Topics, Previous: Introduction, Up: Top [Contents][Index]
cannam@167:| • Complex One-Dimensional DFTs: | cannam@167: | |
| • Complex Multi-Dimensional DFTs: | cannam@167: | |
| • One-Dimensional DFTs of Real Data: | cannam@167: | |
| • Multi-Dimensional DFTs of Real Data: | cannam@167: | |
| • More DFTs of Real Data: | cannam@167: |
This chapter describes the basic usage of FFTW, i.e., how to compute cannam@167: cannam@167: the Fourier transform of a single array. This chapter tells the cannam@167: truth, but not the whole truth. Specifically, FFTW implements cannam@167: additional routines and flags that are not documented here, although cannam@167: in many cases we try to indicate where added capabilities exist. For cannam@167: more complete information, see FFTW Reference. (Note that you cannam@167: need to compile and install FFTW before you can use it in a program. cannam@167: For the details of the installation, see Installation and Customization.) cannam@167:
cannam@167: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@167: main interest lies in one of the other transform types. cannam@167:
cannam@167:Users of FFTW version 2 and earlier may also want to read Upgrading from FFTW version 2. cannam@167:
cannam@167:You can cannam@167: read the tutorial in bit-reversed order after computing your first cannam@167: transform.
cannam@167: