抄録
An efficient multi-dimensional FFT algorithm for vector processors has been developed. In the algorithm, the multi-dimensional array to be transformed is converted to a one-dimensional array so that simultaneous vector processes are effectively executed. Afterwards, the one-dimensional array is re-converted to an array with the original dimensions. The computational time is substantially reduced with a highly vectorized computer code. The authors compared the computational time for the present algorithm with that for conventional algorithms for a 3-D FFT on the Cray Y-MP.
