2015 · 20 citations · 4 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureField-programmable Gate ArraysLow-power DesignDigital Signal ProcessingField-programmable Gate Array ArchitectureFpga ArchitectureHardware AccelerationI/o ArchitecturePower OptimizationArea EfficiencyArea-efficient Fpga ArchitectureDigital Signal Processing Block ArchitectureDigital Signal Processing BlocksFast Fourier TransformFixed-point ComputationFourier TransformProcessor Architecture
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.
4
An algorithm for the machine calculation of complex Fourier series
J.W. Cooley, John W. Tukey · Mathematics of Computation · 1965 · 12.2K citations
BLAS Comparison on FPGA, CPU and GPU
Srinidhi Kestur, John D. Davis, Oliver Williams · 2010 · 161 citations