English
You are here:
HyperLength FFT
RFEL’s Hyperlength FFT design allows the implementation of very long transforms in FPGA by utilising external RAM. The architecture uses a pair of pipeline FFTs to implement an N point and an M point DFT, which, together with data re-ordering and twiddle factor application, form an (N x M)-point FFT. External RAM is used to perform the required data re-ordering stages. Twiddle factors are generated arithmetically using logic within the FPGA rather than being stored in external memory.
The driving factor behind the FPGA choice for the Hyperlength FFT is often not the resource required to implement the processing, but the bandwidth limits of the available external RAM devices and the I/O required connecting them.
The driving factor behind the FPGA choice for the Hyperlength FFT is often not the resource required to implement the processing, but the bandwidth limits of the available external RAM devices and the I/O required connecting them.
Features
- Continuous real-time processing up to 200MS/s complex.
- 128K to 256 Million points with external memory.
- Twiddle bit and bit growth adjustable (factory setting).
- Fully pipelined.
- Integer powers of two or prime length FFTs.
Benefits
- Very long FFT lengths, not normally possible in FPGA using internal memory.
- Maximises silicon efficiency and performance for each application.
- Continuous real-time processing.
- Fixed point MATLAB model available to de-risk core integration process.
Block Diagram of the HyperLength FFT IP Core
View HyperLength FFT full description to...
- see the entire HyperLength FFT datasheet
- get in contact with HyperLength FFT Supplier