搜索资源列表
一篇用VHDL实现快速傅立叶变换的论文
- 一篇用VHDL实现快速傅立叶变换的论文，包括原理分析和代码实现，印度圣雄甘地大学M.A.学院提供-VHDL with a Fast Fourier Transform papers, including the principle of analysis and implementation of the code, the Mahatma Gandhi Institute of the University of Marat
fft
- 快速傅立叶变换（FFT）的FPGA实现,本系统采用了不同点数基2的复FFT。-Fast Fourier Transform (FFT) of the FPGA, the system uses two different points-based complex FFT.
16Point-FFT
- 16点FFT VHDL源程序，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
signalprocess_fft_VHDL
- 一篇用VHDL实现快速傅立叶变换的论文，包括原理分析和代码实现，印度圣雄甘地大学M.A.学院提供，同时包含使用手册，做FFT很好的-VHDL with a fast Fourier transform papers, including the principle of analysis and code, India Mahatma Gandhi Institute of the University of MA, at the same time contains the user manu
VHDL
- VHDL实现快速傅立叶变换 -VHDL implementation VHDL implementation of Fast Fourier Transform Fast Fourier Transform
cf_fft_1024_8
- 用verilog编写的1024点的fft快速傅立叶变换-Verilog prepared using 1024 point fft Fast Fourier Transform
CORDIC
- 数字控制振荡器（NCO，numerical controlled oscillator）是软件无线电、直接数据频 率合成器（DDS，Direct digital synthesizer）、快速傅立叶变换（FFT，Fast Fourier Transform） 等的重要组成部分，同时也是决定其性能的主要因素之一，随着芯片集成度的提高、在信号 处理、数字通信领域、调制解调、变频调速、制导控制、电力电子等方面得到越来越广泛的 应用。-Digital controlled oscilla
FPGA_FFT
- 基于VHDL语言的一个FFT快速傅里叶变换程序。采用4蝶形算法-VHDL language based on a FFT Fast Fourier Transform procedure. 4 butterfly algorithm used
2fft
- 基2FFT算法实现改进的一篇很好的文章,有利于傅立叶变换的理解-2FFT-based algorithm to improve a very good article, and is conducive to the understanding of Fourier Transform
fft
- fast fourier transform
1024FFTvhdl
- 1024 fast fourier transformation vhdl code
cfft
- 基于FPGA的快速傅里叶算法设计，VHDL语言写的，编译可通过-FPGA-based fast Fourier algorithm design, VHDL language, the compiler can
butterfly
- 计算离散傅里叶变换的一种快速算法,简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少,特别是被变换的抽样点数N越多,FFT算法计算量的节省就越显著。 -Discrete Fourier transform calculation of a fast algorithm, referred to as FFT. Fast Fourier Transform in 1965 by JW Cooley an
CComplex_CFourior
- 离散傅立叶变换的实现,基本功能：构造一个CFourior类的对象。-Discrete Fourier transform realization of the basic functions: to construct a CFourior class object.
FFT
- Fast Fourier Transform in vhdl and matlab
cfft4
- fft radix-4 VHDL for expanding to any fourier transform
cfft4X12
- fft radix-4 for expanding to any fourier transform
GeneratingFPGA-AcceleratedDFTLibraries
- 关于DFT的文章，应用FPGA实现傅立叶变换。-Abstract—We present a domain-specific approach to generate high-performance hardware-software partitioned implementations of the discrete Fourier transform (DFT). The partitioning strategy is a heuristic based on the DFT
IFFT
- 这是关于傅里叶反变换的一个完整的ISE的工程..使用verilog语言-This is on the Fourier transform of a complete anti-ISE project using the verilog language ..
cFFT
- CFFT is a radix-4 fast Fourier transform (FFT) core with configurable data width and a configurable number of sample points in the FFT. Twiddle factors are implemented using the CORDIC algorithm, causing the gain of the CFFT core to be differen