论文信息 - Area and frequency optimized 1024 point Radix-2 FFT processor on FPGA

Area and frequency optimized 1024 point Radix-2 FFT processor on FPGA

This paper presents a Fast Fourier Transform (FFT) processor optimized for both `area' and `frequency'. The processor architecture is deeply pipelined Radix-2 butterfly unit, 1024 point, 64bit Fixed Point input with 32bit real and 32bit imaginary, Decimation In Time (DIT) FFT processor on Field Programmable Gate Array (FPGA). The proposed architecture is based on Dual RAM Ping-Pong Burst I/O with efficient addressing techniques which clocks at 385.804MHz on Xilinx Virtex-6 xc6vlx550t-2ff1759 taking 16.376μs to calculate one set of 1024 point FFT.

P. M. Sobha | Vinay Kumar M | David Selvakumar A

[1] Javad Frounchi,et al. A High Speed FPGA Implementation of a 1024-Point Complex FFT Processor , 2010, 2010 Second International Conference on Computer and Network Technology.

[2] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .

[3] T. Sansaloni,et al. Efficient FPGA implementation of Cordic algorithm for circular and linear coordinates , 2005, International Conference on Field Programmable Logic and Applications, 2005..

[4] A. W. M. van den Enden,et al. Discrete Time Signal Processing , 1989 .

[5] Uwe Meyer-Baese,et al. Digital Signal Processing with Field Programmable Gate Arrays , 2001 .

[6] Weng Fook Lee. Verilog Coding for Logic Synthesis , 2003 .