The Fast Fourier Transform on a digital image processor --implementation and applications
Eugene V. Price · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1984
A two-dimensional FFT algorithm has been implemented on a pipelined image processor with parallel feedback image data paths. The transform of a 512x512 pixel image, or say 256 images 32x32 pixels in size, can be carried out in one minute (excluding the transpose of the image). The image-processor architecture lends itself very well to some portions of the FFT computation; other portions suggest directions for future hardware development.