cannam@95:
cannam@95: cannam@95: Next: More DFTs of Real Data, cannam@95: Previous: One-Dimensional DFTs of Real Data, cannam@95: Up: Tutorial cannam@95:
Multi-dimensional DFTs of real data use the following planner routines: cannam@95: cannam@95:
fftw_plan fftw_plan_dft_r2c_2d(int n0, int n1, cannam@95: double *in, fftw_complex *out, cannam@95: unsigned flags); cannam@95: fftw_plan fftw_plan_dft_r2c_3d(int n0, int n1, int n2, cannam@95: double *in, fftw_complex *out, cannam@95: unsigned flags); cannam@95: fftw_plan fftw_plan_dft_r2c(int rank, const int *n, cannam@95: double *in, fftw_complex *out, cannam@95: unsigned flags); cannam@95:cannam@95:
cannam@95: as well as the corresponding c2r routines with the input/output
cannam@95: types swapped. These routines work similarly to their complex
cannam@95: analogues, except for the fact that here the complex output array is cut
cannam@95: roughly in half and the real array requires padding for in-place
cannam@95: transforms (as in 1d, above).
cannam@95:
cannam@95:
As before, n is the logical size of the array, and the
cannam@95: consequences of this on the the format of the complex arrays deserve
cannam@95: careful attention.
cannam@95: Suppose that the real data has dimensions n0 × n1 × n2 × … × nd-1 (in row-major order).
cannam@95: Then, after an r2c transform, the output is an n0 × n1 × n2 × … × (nd-1/2 + 1) array of
cannam@95: fftw_complex values in row-major order, corresponding to slightly
cannam@95: over half of the output of the corresponding complex DFT. (The division
cannam@95: is rounded down.) The ordering of the data is otherwise exactly the
cannam@95: same as in the complex-DFT case.
cannam@95:
cannam@95:
For out-of-place transforms, this is the end of the story: the real cannam@95: data is stored as a row-major array of size n0 × n1 × n2 × … × nd-1 and the complex cannam@95: data is stored as a row-major array of size n0 × n1 × n2 × … × (nd-1/2 + 1). cannam@95: cannam@95:
For in-place transforms, however, extra padding of the real-data array
cannam@95: is necessary because the complex array is larger than the real array,
cannam@95: and the two arrays share the same memory locations. Thus, for
cannam@95: in-place transforms, the final dimension of the real-data array must
cannam@95: be padded with extra values to accommodate the size of the complex
cannam@95: data—two values if the last dimension is even and one if it is odd.
cannam@95: That is, the last dimension of the real data must physically contain
cannam@95: 2 * (nd-1/2+1)double values (exactly enough to hold the complex data).
cannam@95: This physical array size does not, however, change the logical
cannam@95: array size—only
cannam@95: nd-1values are actually stored in the last dimension, and
cannam@95: nd-1is the last dimension passed to the plan-creation routine.
cannam@95:
cannam@95:
For example, consider the transform of a two-dimensional real array of
cannam@95: size n0 by n1. The output of the r2c transform is a
cannam@95: two-dimensional complex array of size n0 by n1/2+1, where
cannam@95: the y dimension has been cut nearly in half because of
cannam@95: redundancies in the output. Because fftw_complex is twice the
cannam@95: size of double, the output array is slightly bigger than the
cannam@95: input array. Thus, if we want to compute the transform in place, we
cannam@95: must pad the input array so that it is of size n0 by
cannam@95: 2*(n1/2+1). If n1 is even, then there are two padding
cannam@95: elements at the end of each row (which need not be initialized, as they
cannam@95: are only used for output).
cannam@95:
cannam@95:
The following illustration depicts the input and output arrays just
cannam@95: described, for both the out-of-place and in-place transforms (with the
cannam@95: arrows indicating consecutive memory locations):
cannam@95:
cannam@95:
cannam@95:
These transforms are unnormalized, so an r2c followed by a c2r cannam@95: transform (or vice versa) will result in the original data scaled by cannam@95: the number of real data elements—that is, the product of the cannam@95: (logical) dimensions of the real data. cannam@95: cannam@95: cannam@95:
(Because the last dimension is treated specially, if it is equal to
cannam@95: 1 the transform is not equivalent to a lower-dimensional
cannam@95: r2c/c2r transform. In that case, the last complex dimension also has
cannam@95: size 1 (=1/2+1), and no advantage is gained over the
cannam@95: complex transforms.)
cannam@95:
cannam@95:
cannam@95:
cannam@95: