Effective implementations of multi-dimensional radix-2 FFT Original Research Article

The Fast Fourier Transform (FFT), is well known as a fast method for the Discrete Fourier Transform (DFT), and the calculation time is in proportion to NlogN, where N is the system size. But unfortunately, inappropriate implementation with no care for the structure of the target machine increases the proportional coefficient by a factor of 10. We propose effective implementations in the case of multi-dimensional radix-2 FFT for the recent RISC workstation and the vector-type supercomputer, respectively.