Chris@42: Next: Column-major Format, Previous: Multi-dimensional Array Format, Up: Multi-dimensional Array Format [Contents][Index]
Chris@42:The multi-dimensional arrays passed to fftw_plan_dft etcetera
Chris@42: are expected to be stored as a single contiguous block in
Chris@42: row-major order (sometimes called “C order”). Basically, this
Chris@42: means that as you step through adjacent memory locations, the first
Chris@42: dimension’s index varies most slowly and the last dimension’s index
Chris@42: varies most quickly.
Chris@42:
To be more explicit, let us consider an array of rank d whose Chris@42: dimensions are n0 × n1 × n2 × … × nd-1. Now, we specify a location in the array by a Chris@42: sequence of d (zero-based) indices, one for each dimension: Chris@42: (i0, i1, i2,..., id-1).If the array is stored in row-major Chris@42: order, then this element is located at the position Chris@42: id-1 + nd-1 * (id-2 + nd-2 * (... + n1 * i0)).
Chris@42:Note that, for the ordinary complex DFT, each element of the array
Chris@42: must be of type fftw_complex; i.e. a (real, imaginary) pair of
Chris@42: (double-precision) numbers.
Chris@42:
In the advanced FFTW interface, the physical dimensions n from Chris@42: which the indices are computed can be different from (larger than) Chris@42: the logical dimensions of the transform to be computed, in order to Chris@42: transform a subset of a larger array. Chris@42: Chris@42: Note also that, in the advanced interface, the expression above is Chris@42: multiplied by a stride to get the actual array index—this is Chris@42: useful in situations where each element of the multi-dimensional array Chris@42: is actually a data structure (or another array), and you just want to Chris@42: transform a single field. In the basic interface, however, the stride Chris@42: is 1. Chris@42: Chris@42:
Chris@42: Chris@42: Chris@42: Chris@42: Chris@42: