Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: FFTW 3.3.8: Tutorial Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82:
Chris@82:

Chris@82: Next: , Previous: , Up: Top   [Contents][Index]

Chris@82:
Chris@82:
Chris@82: Chris@82:

2 Tutorial

Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: Chris@82:
• Complex One-Dimensional DFTs:   Chris@82:
• Complex Multi-Dimensional DFTs:   Chris@82:
• One-Dimensional DFTs of Real Data:   Chris@82:
• Multi-Dimensional DFTs of Real Data:   Chris@82:
• More DFTs of Real Data:   Chris@82:
Chris@82: Chris@82:

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

Chris@82:

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

Chris@82:

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

Chris@82:
Chris@82:
Chris@82:

Footnotes

Chris@82: Chris@82:

(1)

Chris@82:

You can Chris@82: read the tutorial in bit-reversed order after computing your first Chris@82: transform.

Chris@82:
Chris@82: Chris@82: Chris@82: Chris@82: Chris@82: