Real-to-Real Transform Kinds

Chris@10: Chris@10: Chris@10: Real-to-Real Transform Kinds - FFTW 3.3.3 Chris@10: Chris@10: Chris@10: Chris@10: Chris@10: Chris@10: Chris@10: Chris@10: Chris@10: Chris@10: Chris@10: Chris@10: Chris@10:

Chris@10: Chris@10: Chris@10:

Chris@10: Previous: Real-to-Real Transforms, Chris@10: Up: Basic Interface Chris@10:

Chris@10:

Chris@10: Chris@10:

4.3.6 Real-to-Real Transform Kinds

Chris@10: Chris@10:

Chris@10: FFTW currently supports 11 different r2r transform kinds, specified by Chris@10: one of the constants below. For the precise definitions of these Chris@10: transforms, see What FFTW Really Computes. For a more colloquial Chris@10: introduction to these transform kinds, see More DFTs of Real Data. Chris@10: Chris@10:

For dimension of size n, there is a corresponding “logical” Chris@10: dimension N that determines the normalization (and the optimal Chris@10: factorization); the formula for N is given for each kind below. Chris@10: Also, with each transform kind is listed its corrsponding inverse Chris@10: transform. FFTW computes unnormalized transforms: a transform followed Chris@10: by its inverse will result in the original data multiplied by N Chris@10: (or the product of the N's for each dimension, in Chris@10: multi-dimensions). Chris@10: Chris@10:

FFTW_R2HC computes a real-input DFT with output in Chris@10: “halfcomplex” format, i.e. real and imaginary parts for a transform of Chris@10: size n stored as: Chris@10:
Chris@10: r₀, r₁, r₂, ..., r_n/2, i_(n+1)/2-1, ..., i₂, i₁ Chris@10:
(Logical N=n, inverse is FFTW_HC2R.) Chris@10: Chris@10:
FFTW_HC2R computes the reverse of FFTW_R2HC, above. Chris@10: (Logical N=n, inverse is FFTW_R2HC.) Chris@10: Chris@10:
FFTW_DHT computes a discrete Hartley transform. Chris@10: (Logical N=n, inverse is FFTW_DHT.) Chris@10: Chris@10:
FFTW_REDFT00 computes an REDFT00 transform, i.e. a DCT-I. Chris@10: (Logical N=2*(n-1), inverse is FFTW_REDFT00.) Chris@10: Chris@10:
FFTW_REDFT10 computes an REDFT10 transform, i.e. a DCT-II (sometimes called “the” DCT). Chris@10: (Logical N=2*n, inverse is FFTW_REDFT01.) Chris@10: Chris@10:
FFTW_REDFT01 computes an REDFT01 transform, i.e. a DCT-III (sometimes called “the” IDCT, being the inverse of DCT-II). Chris@10: (Logical N=2*n, inverse is FFTW_REDFT=10.) Chris@10: Chris@10:
FFTW_REDFT11 computes an REDFT11 transform, i.e. a DCT-IV. Chris@10: (Logical N=2*n, inverse is FFTW_REDFT11.) Chris@10: Chris@10:
FFTW_RODFT00 computes an RODFT00 transform, i.e. a DST-I. Chris@10: (Logical N=2*(n+1), inverse is FFTW_RODFT00.) Chris@10: Chris@10:
FFTW_RODFT10 computes an RODFT10 transform, i.e. a DST-II. Chris@10: (Logical N=2*n, inverse is FFTW_RODFT01.) Chris@10: Chris@10:
FFTW_RODFT01 computes an RODFT01 transform, i.e. a DST-III. Chris@10: (Logical N=2*n, inverse is FFTW_RODFT=10.) Chris@10: Chris@10:
FFTW_RODFT11 computes an RODFT11 transform, i.e. a DST-IV. Chris@10: (Logical N=2*n, inverse is FFTW_RODFT11.) Chris@10: Chris@10:

Chris@10: Chris@10: Chris@10: Chris@10: