Similar articles

Abstract: We present a novel method to implement the radix-2 fast Fourier transform (FFT) algorithm on field programmable gate arrays (FPGA). The FFT architecture exploits parallelism by having more pipelined units in the stages, and more parallel units within a stage. It has the noticeable advantages of high speed and more efficient resource utilization by employing four ganged butterfly engines (GBEs), and can be well matched to the placement of the resources on the FPGA. We adopt the decimation-in-frequency (DIF) radix-2 FFT algorithm and implement the FFT processor on a state-of-the-art FPGA. Experimental results show that the processor can compute 1024-point complex radix-2 FFT in about 11 μs with a clock frequency of 200 MHz.

[1]Asano, S., Maruyama, T., Yamaguchi, Y., 2009. Performance Comparison of FPGA, GPU and CPU in Image Processing. Int. Conf. on Field Programmable Logic and Applications, p.126-131.

[2]Camarda, F., Prevotet, J.C., Nouvel, F., 2009. Implementation of a Reconfigurable Fast Fourier Transform Application to Digital Terrestrial Television Broadcasting. Int. Conf. on Field Programmable Logic and Applications, p.353-358.

[3]Chalermsuk, K., Spaanenburg, R.H., Spaanenburg, L., Seutter, M., Stoorvogel, H., 2008. Flexible-Length Fast Fourier Transform for COFDM. 15th IEEE Int. Conf. on Electronics, Circuits and Systems, p.534-537.

[4]Cooley, J.W., Tukey, J.W., 1965. An algorithm for the machine calculation of complex Fourier series. Math. Comput., 19:297-301.

[5]Garrido, M., Parhi, K.K., Grajal, J., 2009. A pipelined FFT architecture for real-valued signals. IEEE Trans. Circ. Syst. I: Reg. Papers, 56(12):2634-2643.

[6]He, S.S., Torkelson, M., 1996. A New Approach to Pipeline FFT Processor. Proc. 10th Int. Parallel Process. Symp., p.766-770.

[7]He, S.S., Torkelson, M., 1998. Design and Implementation of 1024-point Pipeline FFT Processor. Custom Integrated Circuits Conf., p.131-134.

[8]Kee, H., Bhattacharyya, S.S., Petersen, N., Kornerup, J., 2009. Resource-Efficient Acceleration of 2-Dimensional Fast Fourier Transform Computations on FPGAs. Third ACM/IEEE Int. Conf. on Distributed Smart Cameras, p.1-8.

[9]Liu, X., Yu, F., Wang, Z.K., 2011. A pipelined architecture for normal I/O order FFT. J. Zhejiang Univ.-Sci. C (Comput. & Electron.), 12(1):76-82.

[10]Pitkanen, T., Takala, J., 2009. Low-Power Application- Specific Processor for FFT Computations. IEEE Int. Conf. on Acoustics, Speech and Signal Processing, p.593-596.

[11]Radhouane, R., Liu, P., Modlin, C., 2000. Minimizing the Memory Requirement for Continuous Flow FFT Implementation: Continuous Flow Mixed Mode FFT (CFMM-FFT). Proc. IEEE Int. Symp. on Circuits and Systems, 1:116-119.

[12]Sun, T.Y., Yu, Y.H., 2009. Memory Usage Reduction Method for FFT Implementations on DSP Based Embedded System. IEEE 13th Int. Symp. on Consumer Electronics, p.812-815.

[13]Thoen, D.J., Bongers, W.A., Westerhof, E., Oosterbeek, J.W., de Baar, M.R., van den Berg, M.A., van Beveren, V., Burger, A., Goede, A., Graswinckel, M.F., et al., 2009. Fast Fourier Transform Based Diagnostics for Spectral Characterization of Millimeter Waves in Tokamaks. 34th Int. Conf. on Infrared, Millimeter, and Terahertz Waves, p.1-2.

[14]Yeh, H.G., Truong, G., 2007. Speed and Area Analysis of Memory Based FFT Processors in a FPGA. Wireless Telecommunications Symp., p.1-6.