High-Performance 16-Point Complex FFT•This document is (c) Xilinx, Inc. 1999. No part of this file may be modified, transmitted to any third party (other than asintended by Xilinx) or used without a Xilinx programmable or hardwire device without Xilinx\'s prior written permission.1 Functional Des criptionThe xFFT16 fast Fourier transform (FFT) Core computes a 16-point complex FFT. The input data is a vector of 16 complex values represented as 16-bit 2’s complement numbers – 16-bits for each of the real and imaginary component of a datum.2 Theory of OperationThe discrete Fourier transform (DFT) X (k), k = 0,K , N -1of a sequence x(n), n = 0,K , N -1isdefined as:
You Might Like
Recommended ContentMore
Open source project More
Popular Components
Searched by Users
Just Take a LookMore
Trending Downloads
Trending ArticlesMore