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