Rotating a three-dimensional array in an optimal position for vector processing: case study for a three-dimensional fast Fourier transform - Goedecker, S. (Elsevier)
We show, that a three-dimensional array of dimension n"1, n"2, n"3 can be rotated in such a way, that all the innermost loops have lengths, which are products of two dimensions, i.e. n"1n"2, n"1n"3, n"2n"3. This technique is then applied to rotate a parallelepiped of data in an optimal position for Fourier transformations along the three axes. The resulting three-dimensional FFT (fast Fourier transform) has then only inner loops of length n"1n"2, n"1n"3, n"2n"3. This increased loop length results in a significant reduction of the required CPU time on vector machines.
http://linkinghub.elsevier.com/retrieve/pii/0010-4655(93)90057-J
Keywords: SQ-SU; U