FFTW 3.2.1

d@0:

FFTW User Manual d@0:
1 Introduction d@0:
2 Tutorial d@0:
- 2.1 Complex One-Dimensional DFTs d@0:
- 2.2 Complex Multi-Dimensional DFTs d@0:
- 2.3 One-Dimensional DFTs of Real Data d@0:
- 2.4 Multi-Dimensional DFTs of Real Data d@0:
- 2.5 More DFTs of Real Data d@0:
  - 2.5.1 The Halfcomplex-format DFT d@0:
  - 2.5.2 Real even/odd DFTs (cosine/sine transforms) d@0:
  - 2.5.3 The Discrete Hartley Transform d@0:
  d@0:
d@0:
3 Other Important Topics d@0:
- 3.1 Data Alignment d@0:
  - 3.1.1 SIMD alignment and fftw_malloc d@0:
  - 3.1.2 Stack alignment on x86 d@0:
  d@0:
- 3.2 Multi-dimensional Array Format d@0:
  - 3.2.1 Row-major Format d@0:
  - 3.2.2 Column-major Format d@0:
  - 3.2.3 Fixed-size Arrays in C d@0:
  - 3.2.4 Dynamic Arrays in C d@0:
  - 3.2.5 Dynamic Arrays in C—The Wrong Way d@0:
  d@0:
- 3.3 Words of Wisdom—Saving Plans d@0:
- 3.4 Caveats in Using Wisdom d@0:
d@0:
4 FFTW Reference d@0:
- 4.1 Data Types and Files d@0:
  - 4.1.1 Complex numbers d@0:
  - 4.1.2 Precision d@0:
  - 4.1.3 Memory Allocation d@0:
  d@0:
- 4.2 Using Plans d@0:
- 4.3 Basic Interface d@0:
  - 4.3.1 Complex DFTs d@0:
  - 4.3.2 Planner Flags d@0:
  - 4.3.3 Real-data DFTs d@0:
  - 4.3.4 Real-data DFT Array Format d@0:
  - 4.3.5 Real-to-Real Transforms d@0:
  - 4.3.6 Real-to-Real Transform Kinds d@0:
  d@0:
- 4.4 Advanced Interface d@0:
  - 4.4.1 Advanced Complex DFTs d@0:
  - 4.4.2 Advanced Real-data DFTs d@0:
  - 4.4.3 Advanced Real-to-real Transforms d@0:
  d@0:
- 4.5 Guru Interface d@0:
  - 4.5.1 Interleaved and split arrays d@0:
  - 4.5.2 Guru vector and transform sizes d@0:
  - 4.5.3 Guru Complex DFTs d@0:
  - 4.5.4 Guru Real-data DFTs d@0:
  - 4.5.5 Guru Real-to-real Transforms d@0:
  - 4.5.6 64-bit Guru Interface d@0:
  d@0:
- 4.6 New-array Execute Functions d@0:
- 4.7 Wisdom d@0:
  - 4.7.1 Wisdom Export d@0:
  - 4.7.2 Wisdom Import d@0:
  - 4.7.3 Forgetting Wisdom d@0:
  - 4.7.4 Wisdom Utilities d@0:
  d@0:
- 4.8 What FFTW Really Computes d@0:
  - 4.8.1 The 1d Discrete Fourier Transform (DFT) d@0:
  - 4.8.2 The 1d Real-data DFT d@0:
  - 4.8.3 1d Real-even DFTs (DCTs) d@0:
  - 4.8.4 1d Real-odd DFTs (DSTs) d@0:
  - 4.8.5 1d Discrete Hartley Transforms (DHTs) d@0:
  - 4.8.6 Multi-dimensional Transforms d@0:
  d@0:
d@0:
5 Multi-threaded FFTW d@0:
- 5.1 Installation and Supported Hardware/Software d@0:
- 5.2 Usage of Multi-threaded FFTW d@0:
- 5.3 How Many Threads to Use? d@0:
- 5.4 Thread safety d@0:
d@0:
6 FFTW on the Cell Processor d@0:
- 6.1 Cell Installation d@0:
- 6.2 Cell Caveats d@0:
- 6.3 FFTW Accuracy on Cell d@0:
d@0:
7 Calling FFTW from Fortran d@0:
- 7.1 Fortran-interface routines d@0:
- 7.2 FFTW Constants in Fortran d@0:
- 7.3 FFTW Execution in Fortran d@0:
- 7.4 Fortran Examples d@0:
- 7.5 Wisdom of Fortran? d@0:
d@0:
8 Upgrading from FFTW version 2 d@0:
9 Installation and Customization d@0:
- 9.1 Installation on Unix d@0:
- 9.2 Installation on non-Unix systems d@0:
- 9.3 Cycle Counters d@0:
- 9.4 Generating your own code d@0:
d@0:
10 Acknowledgments d@0:
11 License and Copyright d@0:
12 Concept Index d@0:
13 Library Index d@0:

d@0:

Welcome to FFTW, the Fastest Fourier Transform in the West. FFTW is a d@0: collection of fast C routines to compute the discrete Fourier transform. d@0: This manual documents FFTW version 3.2.1. d@0: d@0:

FFTW 3.2.1

Table of Contents

FFTW User Manual