搜索资源列表
Floating-point-complex-radix-2-decimation-in-time-
- 浮点复数基2时分FFT完成适当的FFT，输出改写输入缓冲器。-floating-point complex FFT-based two hours to complete the FFT output rewritten input buffer.
ligl-fft
- 基于tms320vc55*系列DSP常用算法，包括： 1. Experiment 7A - Radix-2 Complex FFT in C 2. Experiment 7B - Radix-2 Complex FFT in C55x Assembly Language 3. Experiment 7C - Radix-2 Complex FFT and IFFT 4. Experiment 7C - Fast Convolution 5. matla
fft
- fft.c--This computes an in-place complex-to-complex FFT x and y are the real and imaginary arrays of 2^m points. dir = 1 gives forward transform dir = -1 gives reverse transform
fft
- This computes an in-place complex-to-complex FFT x and y are the real and imaginary arrays of 2^m points. dir = 1 gives forward transform dir = -1 gives reverse transform
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
1024FFT_ASIC
- 1024点复数专用FFT处理器的ASIC实现-1024 point complex FFT processor dedicated ASIC realization
fft
- Radix-2 Fast Fourier Transform, real or complex sin/cos transform -Radix-2 Fast Fourier Transform, real or complex sin/cos transform
fft
- ti 的FFT 算法库,里面有PDF的理论基础,和算法库,很齐全,很有参考价值.-This FFT library contains generic FFT module (32-bit implementation) for real/complex FFT
FFT_fixedPoint_console
- 定点复数FFT算法 C语言实现 支持点数为128,256,512,1024,2048可配置 同时附带文档-Fixed-point complex FFT algorithm for C language support 128,256,512,1024,2048 points can be configured at the same time as the document attached
simple_app
- TMS320c672x通过DSPLIB库实现复数FFT，并可实现两个实数数列的高效FFT。-TMS320c672x achieved through DSPLIB library complex FFT, and can realize two real sequences efficient FFT.
fft
- The code in this library contains an implementation for Fast Fourier Transforms on arbitrary length complex data. It is based on old FORTRAN code, found in a signal processing archive. I dissected the FORTRAN code, since it worked with normal a
fft
- Program FFT.FOR This FORTRAN program calculates the fast Fourier transform of a timeseries (real and/or complex) or the inverse Fourier transform of spectral components (real and/or complex). The FFT is based on the algorithm given in Nu
FFT_kris32
- This source code is the 32point FFT(Fast Fourier Transform) for Real Time sampling system (like PQ meter or Digital Relay). The complex computation is realized without complex.h in this code, based on only C. -This source code is the 32point FFT(Fast
FFT
- 2点的碟形算法，其中包含了旋转因子乘法器，这是一种高效的复数乘法器.-2point dish method, which includes the rotation factor multiplier, which is a highly efficient complex multipliers.
FFt
- 基2FFT蝶形运算器，代码有仿真用数据。主代码用于仿真，碟形运算和复数乘法元件化-Based 2FFT butterfly, code with simulation data used. Master code for simulation, dish components of computing and complex multiplication
F2812-FFT
- FFT 并不是一种新的变换，它是离散傅立叶变换（DFT）的一种快速算法。由于我们在计算DFT 时一次复数乘法需用四次实数乘法和二次实数加法；一次复数加法则需二次实数加 法。每运算一个X（k）需要4N 次复数乘法及2N+2（N-1）=2（2N-1）次实数加法。所以 整个DFT 运算总共需要4N^2 次实数乘法和N*2(2N-1)=2N(2N-1)次实数加法。如此一来，计算时乘法次数和加法次数都是和N^2 成正比的，当N 很大时，运算量是可观的，因而需要 改进对DFT 的算法减少运算速度
FFT
- 基于TMS320C54x的FFT实现，从而掌握掌握8～1024点复数 C54x FFT程序的使用方法-TMS320C54x the FFT-based implementation to grasp the master 8 1024 point complex ' C54x FFT program to use
FPGA--SIGNAL-FFT-FIR
- 目前,在极高频率的电子装置或系统中不能采用数字信号处理的原因有两个:一是A/D转换器的速度不能达到足够快 二是信号处理任务太复杂,达不到实时处理的要求.-At present, in the high frequency of the electronic device or system cannot use the digital signal processing for two reasons: one is the A/D converter cannot reach the spee
fft
- 此函数是通用的快速傅里叶变换C语言函数，移植性强，以下部分不依赖硬件。此函数采用联合体的形式表示一个复数，输入为自然顺序的复数（输入实数是可令复数虚部为0），输出为经过FFT变换的自然顺序的复数-This function is generic fast Fourier transform C language function, strong transplantation, the following sections do not rely on hardware. This functi