搜索资源列表
butter
- 基-2的FFT的蝶形算法，verilog HDL 的源代码--2 Of the FFT butterfly-based algorithms, verilog HDL source code
BASED-MSP430FFT
- 基于MSP430的FFT算法 FFT利用基-2算法实现 包括倒序和蝶形循环两部分-MSP430-based FFT algorithm FFT algorithm using base-2 and the butterfly cycle, including two reverse
butterfly_fft_DSP
- This is an implementation of an butterfly Discret fast fourier transform that has been implemented on a digital signal processing chip. It is an 8bit algorithm that computes the FFT on input analog data.-This is an implementation of an butterfly Disc
test
- 1024点fft变换，最经典的蝶形运算方法！-1024-point fft transform, the most classical method of butterfly!
butterfly1
- FFT 蝶形处理器的VHDL代码，由一个加法器，一个减法器和一个实例化为组件的旋转因子乘法器ccmul组成-FFT butterfly processor VHDL code by an adder, a subtracter, and an instance of the component into the composition of the rotation factor multiplier ccmul
sim512fft
- 512点FFT程序，分10级蝶形运算完成。-512-point FFT program, sub-10 butterfly to complete.
buffterfly_radix4
- 16点的FFT蝶形运算，用于快速傅里叶变换并行实现，基于verilog语言编写，matlab仿真验证-a method based on 16-point fft butterfly,used to make fast fourier transform,language is verilog.
FFT_Twiddles_Find_DSPrelated
- 下面是找到了基2 FFT蝴蝶旋转因子的Matlab代码。代码计算的 A 相角，在图1（c）和图2（c）所示，旋转因子的因素。我建议你开始8点DIT的FFT图1（a）通过运行代码然后运行图2中的代码为16点DIF FFT（一）。-Below is the Matlab code to find radix-2 FFT butterfly twiddle factors. The code computes the A phase angle factors that are used in t
DFTaFFT
- 离散傅立叶变换DFT源程序，包括时域离散化，求W算子表，原信号的时域描述和离散频域描述。以及快速傅立叶变换FFT源程序，里面有蝶形算法的循环步骤。适合初学者-Discrete Fourier Transform DFT source, including the time-domain discretization, find the W operator table, the original descr iption of the time-domain signal and discret
[kimi]DFT
- 使用蝶形算法实现了DFT（FFT）,并封装成类。-The code for DFT(FFT) by using butterfly model.
_fft
- TS201 优化蝶形算法FFT 思路清晰-TS201 optimization algorithm FFT butterfly clear thinking
multi-verilog
- 乘法器。fft。 基2.蝶形运算。旋转因子-Multipliers. fft. Group 2 butterfly. Twiddle factor
fwdfwfft
- 4位的16点fft，ccmul为复数乘法器，bfproc为蝶形运算器，输出的结果为四位，每一级都要进行round操作。-4 16-point fft, ccmul for complex multiplier, bfproc for the butterfly operation, a result output is four, each stage should be carried out round operation.
cc
- 用K60单片机对得到的数据先进行到位运算(使用雷德算法)，得到FFT运算时需要的数据顺序，然后进行蝶形运算，并将结果进行保存-K60 microcontroller on the data obtained by the first operation carried out in place (with Reid algorithm), data is sequentially obtained when required FFT computation, then butterfly, an
FFT2_test
- 基于基2的蝶型FFT，用C实现，经过测试，没有错误，可以直接拿去使用。-Based on base 2 FFT butterfly type, use C implementation, after testing, there is no error, can be directly used.
srfft_test
- 基于分裂基的蝶型FFT，用C实现，经过测试，没有错误，可以直接拿去使用。-Based on the division of FFT butterfly type, use C implementation, tested, no error, can directly use.
FFT256
- FFT蝶型算法程序，用于完成FFT的可快速变换，相对于其他程序，本例子可以监控每个数据的变换结果，方便用户进行理解。-FFT butterfly algorithm program for the completion of the FFT can be quickly converted with respect to other programs, the present example can monitor the results of each data conversion, use
diexing
- 解压缩之后是FFT蝶形算法程序，可以直接使用(FFT butterfly algorithm program)