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