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