资料下载
High-Performance 16-Point Comp
分享资料个
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 as
intended by Xilinx) or used without a Xilinx programmable or hardwire device without Xilinx's prior written permission.
1 Functional Description
The 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 Operation
The discrete Fourier transform (DFT) X (k), k = 0,K , N -1of a sequence x(n), n = 0,K , N -1is
defined as:
声明：本文内容及配图由入驻作者撰写或者入驻合作网站授权转载。文章观点仅代表作者本人，不代表电子发烧友网立场。文章及其配图仅供工程师学习之用，如有内容侵权或者其他违规问题，请联系本站处理。 举报投诉
- 相关下载
- 相关文章
