|[ << ]||[ < ]||[ Up ]||[ > ]||[ >> ]||[Top]||[Contents]||[Index]||[ ? ]|
4.8 What FFTW Really Computes
In this section, we provide precise mathematical definitions for the transforms that FFTW computes. These transform definitions are fairly standard, but some authors follow slightly different conventions for the normalization of the transform (the constant factor in front) and the sign of the complex exponent. We begin by presenting the one-dimensional (1d) transform definitions, and then give the straightforward extension to multi-dimensional transforms.
|4.8.1 The 1d Discrete Fourier Transform (DFT)|
|4.8.2 The 1d Real-data DFT|
|4.8.3 1d Real-even DFTs (DCTs)|
|4.8.4 1d Real-odd DFTs (DSTs)|
|4.8.5 1d Discrete Hartley Transforms (DHTs)|
|4.8.6 Multi-dimensional Transforms|
This document was generated on March 3, 2012 using texi2html 5.0.