A new method for accelerating the FFT algorithm in massive image processing

Although FFT has a fast speed, it can not meet the need in massive image processing. We propose a method in this paper in which the row-transform results of FFT are accessed in tiling structures and the FFT computation is paralleled with the I/O accessing. Our experiment results show that this method can greatly accelerate the FFT speed for massive image processing.