Fast Fourier Transform (FFT IP Core)
A Fast Fourier Transform Algorithm allows implementation of very long transforms on an FPGA using external RAM. The Fast Fourier Transform IP Core from Mistral is designed for Run time Programmability and Optimal Resource Utilization.
The Fast Fourier Transform algorithm (FFT) is among the most important algorithms in signal processing and data analysis. The Fast Fourier Transform algorithm computes the Discrete Fourier Transform (DFT) of a sequence, or its inverse (IDFT). The Fast Fourier Transform Algorithm converts a signal from its original domain (time or space) to a representation in the frequency domain or vice versa.
The Fast Fourier Transform IP Core (FFT IP Core) from Mistral allows implementation of very long transforms on an FPGA using external RAM. The Fast Fourier Transform algorithm supports run time programmable transform lengths from 256 to 1M (powers-of-2) points. The Maximum transform length is limited by the memory available.
Higher transform lengths are supported and depend on factory configuration. The Fast Fourier Transform Algorithm is tested on Virtex-6 XC6VSX475T FPGA from Xilinx and is designed for Run-time Programmability and Optimal Resource Utilization.
Mistral’s Fast Fourier Transform algorithm (FFT IP Core) uses the Divide-and-Conquer approach for FFT computation. This approach expresses an FFT of length N as a product of 2 integers, L x M. The L and M point FFTs are computed using a pipelined FFT block.
- Transform size, N = 2m, m = 8 to 20 (default). Can be customized
- Forward or inverse complex transform with run time configurability
- Run time computation of twiddle factors
- Single precision floating point arithmetic
- In-order input and output
- Supports data rate of 200MS/s* (complex data)