1 introduction, Introduction – Sundance FC100 User Manual
Page 4

1 Introduction
The Fast Fourier Transform (FFT) is an efficient algorithm for computing the Discrete
Fourier Transform (DFT). This Intellectual Property (IP) core was designed to offer very fast
transform times while keeping a floating-point accuracy at all computational stages.
Sundance’s core is the fastest and the most efficient available in the FPGA world. It also
saves memory resources compared to other floating-point cores available on the market.
Features:
This FFT IP core targets the following devices:
Xilinx FPGA devices
o
Virtex-II
™
, Virtex-II/Pro
™
, Spartan-3
™
, Virtex-4
™
and Virtex-5
™
Radix-2 Fast Fourier Transform (FFT) with pipelined butterfly rank structure
IEEE-754 Floating Point data
o
Uses Xilinx Coregen math operators
o
Customizable precision, speed, and size
o
Any width fixed-point builds also available
Run-time selectable length N=32 to 2
m
, m= 5-26
o
32, 64, 128, 256, 512, 1024, …, 64M points
Run-time selectable Forward/Inverse transform mode
Continuous processing at speeds up to Fmax (see Table 1).
o
Data rate of 250Msps in Virtex-5 FPGA device.
Natural-order inputs and outputs
Includes C/C++ bit-accurate model and data generator
o
Model also usable from MATLAB
Includes Verilog or VHDL testbench and run scripts for simulation purposes and
specific performance characterization.
Applications:
The Pipelined Floating Point FFT IP Core is useful in high performance embedded computing
(HPEC) applications which require continuous digital signal processing (DSP) at high sample
rates. Floating point FFT hardware acceleration or co-processing is often a goal of scientific
algorithms used in High Performance Computing (HPC). End applications and markets
include radar, sonar, spectral analysis, telecommunications and image processing.
User Manual FC100
Page 4 of 12
Last Edited: 25/11/2008 15:00:00