.Chris@19: Next: 1d Discrete Hartley Transforms (DHTs), Chris@19: Previous: 1d Real-even DFTs (DCTs), Chris@19: Up: What FFTW Really Computes Chris@19:
The Real-odd symmetry DFTs in FFTW are exactly equivalent to the unnormalized Chris@19: forward (and backward) DFTs as defined above, where the input array Chris@19: X of length N is purely real and is also odd symmetry. In Chris@19: this case, the output is odd symmetry and purely imaginary. Chris@19: Chris@19: Chris@19:
For the case of RODFT00, this odd symmetry means that
Chris@19: Xj = -XN-j,where we take X to be periodic so that
Chris@19: XN = X0. Because of this redundancy, only the first n real numbers
Chris@19: starting at j=1 are actually stored (the j=0 element is
Chris@19: zero), where N = 2(n+1).
Chris@19:
Chris@19:
The proper definition of odd symmetry for RODFT10,
Chris@19: RODFT01, and RODFT11 transforms is somewhat more intricate
Chris@19: because of the shifts by 1/2 of the input and/or output, although
Chris@19: the corresponding boundary conditions are given in Real even/odd DFTs (cosine/sine transforms). Because of the odd symmetry, however,
Chris@19: the cosine terms in the DFT all cancel and the remaining sine terms are
Chris@19: written explicitly below. This formulation often leads people to call
Chris@19: such a transform a discrete sine transform (DST), although it is
Chris@19: really just a special case of the DFT.
Chris@19:
Chris@19:
Chris@19:
In each of the definitions below, we transform a real array X of Chris@19: length n to a real array Y of length n: Chris@19: Chris@19:
An RODFT00 transform (type-I DST) in FFTW is defined by:
Chris@19:
.An RODFT10 transform (type-II DST) in FFTW is defined by:
Chris@19:
.An RODFT01 transform (type-III DST) in FFTW is defined by:
Chris@19:
.An RODFT11 transform (type-IV DST) in FFTW is defined by:
Chris@19:
.These definitions correspond directly to the unnormalized DFTs used
Chris@19: elsewhere in FFTW (hence the factors of 2 in front of the
Chris@19: summations). The unnormalized inverse of RODFT00 is
Chris@19: RODFT00, of RODFT10 is RODFT01 and vice versa, and
Chris@19: of RODFT11 is RODFT11. Each unnormalized inverse results
Chris@19: in the original array multiplied by N, where N is the
Chris@19: logical DFT size. For RODFT00, N=2(n+1);
Chris@19: otherwise, N=2n.
Chris@19:
Chris@19:
Chris@19:
In defining the discrete sine transform, some authors also include Chris@19: additional factors of Chris@19: √2(or its inverse) multiplying selected inputs and/or outputs. This is a Chris@19: mostly cosmetic change that makes the transform orthogonal, but Chris@19: sacrifices the direct equivalence to an antisymmetric DFT. Chris@19: Chris@19: Chris@19: Chris@19: