The two dimensional fast Fourier transform (2-D FFT) is an indispensable operation in many digital signal processing applications but yet is deemed computationally expensive when performed on a conventional general purpose processors. This paper presents the implementation and performance figures for the Fourier transform on a FPGA-based custom computer. The computation of a 2-D FFT requires O(N2log2N) floating point arithmetic operations for an NxN image. By implementing the FFT algorithm on a custom computing machine (CCM) called Splash-2, a computation speed of 180 Mflops and a speed-up of 23 times over a Sparc-10 workstation is achieved.
CITATION STYLE
Shirazi, N., Athanas, P. M., & Abbott, A. L. (1995). Implementation of a 2-D fast Fourier transform on an FPGA-based custom computing machine. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 975, pp. 282–292). Springer Verlag. https://doi.org/10.1007/3-540-60294-1_122
Mendeley helps you to discover research relevant for your work.