Napa Valley, California
Apr. 15, 1998 to Apr. 17, 1998
Manoucher Shaditalab , ?cole Polytechnique de Montr?al
Guy Bois , ?cole Polytechnique de Montr?al
Mohamad Sawan , ?cole Polytechnique de Montr?al
Design and implementation of parallel pipelined Fast Fourier Transform (FFT), using Decimation in Frequency (DIF) algorithm on FPGA's is presented. The FFT core for 1024 complex data point is implemented on the X-CIM which is a Re-configurable Acceleration Subsystem (RAS) with a TMS320C4x DSP-processor and two XC4013 FPGA as its processing units. The proposed FFT machine is an alternative to the bit serial-parallel FFT algorithm using Distributed Arithmetic Look Up Table (DALUT) method. The advantage of proposed design is mainly in its cost effective and hardware-efficient parallel implementations of the N-point DFT, offering highly attractive throughput rates in relation to the conventional DSP processors. Moreover, the processor's data-path structure is independent of sampled data-points, and it has a self-sorting property where the output is in properly ordered form. Our goal is to improve size-performance requirements of an FFT core function using modular and hierarchical VHDL description combined with IP_Core library elements from Xilinx.
Manoucher Shaditalab, Guy Bois, Mohamad Sawan, "Self Sorting Radix_2 FFT on FPGA using Parallel Pipelined Distributed Arithmetic Blocks", FCCM, 1998, Field-Programmable Custom Computing Machines, Annual IEEE Symposium on, Field-Programmable Custom Computing Machines, Annual IEEE Symposium on 1998, pp. 337, doi:10.1109/FPGA.1998.707943