CoreEL Technologies (I) Pvt. Ltd.: ASIC Design, FPGA Design, PCB Design, Embedded Design Services

Untitled Document

Home \| Careers \| Contact Us

Search

Mechanical Engineering

News & Events

High Resolution 16K-point FFT

Overview

The Fast Fourier Transform (FFT) IP core is a computationally efficient algorithm used to compute the Discrete Fourier Transform for a given input data set (real or complex) using the Cooley-Tukey Algorithm. It is optimally designed specifically with a focus on throughput characteristics required for Radar, imaging, OFDM modulation / demodulation as well as other applications requiring FFT.

Salient Features

		FFT point sizes from 64 – 16K pt in steps of powers of 2 (i.e. 256, 512, 1024)*.
		Fixed Point C-Model for system modeling available
		Support for both FFT & iFFT, run-time configurable
		Optional Run-time configurable Transform Length.
		Support for unscaled & scaled version
			Radix-4 Loop engine only supports N points which are powers of 4
		Input data bit width: 2’s Complement 10 – 24 bits
		Phase Factor bit width: 2’s Complement 10 – 24 bits
		Rounding: Convergent Rounding
		Scaling: Fixed
		Bit Reversed or Natural Order Input

Architectures available:

		Loop engine (Radix-2 & Radix-4)
		High Performance Pipelined Streaming FFT

Applications

		Defense
		Communications

For more information on the above IP Cores, please write to us at ipcores@coreel.com

Products

Digital Video

Signal Processing

256-point High Speed FFT Engine

16K-point FFT

Networking

ASIC Prototyping Platform


Enquiry	E-mail

Home » Privacy Policy » Disclaimer