搜索资源列表
Butterfly-operations
- 8位基2FFT算法的蝶形运算的代码，不含有复数乘法器-8 base 2FFT algorithm butterfly operation code does not contain a complex multiplier
butterfly
- 根据16点DFT算法得出的运算流程图，得到的16点DFT蝶形运算函数-16 point s DFT algorithm
fft1
- 本函数是以2为基的简单快速傅立叶变换算法，计算准确，其中编写的思想是参考蝶形算法应用在时分的fft中。-fft in matlab
fft
- 基于蝶形运算的傅里叶变换与反变换，进行2的N次方点的变换-Butterfly operation on the Fourier transform and inverse transform for the N-th power of 2 transformation point
[kimi]DFT
- 使用蝶形算法实现了DFT（FFT）,并封装成类。-The code for DFT(FFT) by using butterfly model.
DSP_C_Source
- 数字信号处理领域常用的理论之一，蝶形运算的C代码实现，可以直接在CCS环境下编译-Commonly used in the field of digital signal processing theory, one butterfly operation of the C code, can be directly in the CCS compiler environment
On-Fast-M-Sequence-Transforms
- 基于蝶形变化的快速哈达玛变换及其实现过程，非常的实用和高效-Based butterfly change fast Hadamard transform and its implementation process, very practical and efficient
_fft
- TS201 优化蝶形算法FFT 思路清晰-TS201 optimization algorithm FFT butterfly clear thinking
FFT
- 基于DSP的快速傅里叶变换算法，运用蝶形运算减少运算量-DSP-based fast Fourier transform algorithm, the use of the butterfly operation to reduce the amount of calculation
Ultra-wideband-
- 探地雷达超宽带背腔蝶形天线设计与实现-Ultra-wideband ground penetrating radar antenna cavity-backed butterfly design and implementation
FFT
- 其中的函数FFT用于计算一组数据的快速傅里叶变换，输入参数为一个数组，元素个数为2的n次方。程序包含FFT排序算法和蝶形运算。-Function which Fast Fourier Transform FFT calculation for a set of data, the input parameters for an array of n number of elements in a power of 2. Program
multi-verilog
- 乘法器。fft。 基2.蝶形运算。旋转因子-Multipliers. fft. Group 2 butterfly. Twiddle factor
FFT-C
- DIT、FFT 算法的基本思想分析，实数蝶形运算算法的推导以及倒位序算法分析-DIT, the basic idea of FFT algorithm analysis and inversion algorithm sequence deduced real butterfly algorithm analysis
basic2_dit-dif-fft-and-dit-dif-ifft
- c语言 实现fft-dit算法 可运行 完成蝶形运算-basic c conplete fft-dit
simple_trans
- ns2下简单蝶形网络编码的实现 ，值得参考，对学习网络编码在ns2下的实现很有帮助-ns2 the simple butterfly network coding to achieve, it is also useful for the study of network coding in ns2 realized helpful
fft
- 基于DSP2812的FFT自编源程序 位倒序 基2-时间抽取 蝶形算法-The source DSP2812 FFT-based self
6-fft
- DSP实验中的FFT算法，为汇编代码，可以实现FFT蝶形运算等-DSP experiment FFT algorithm for assembly code
butterfly
- FFT模块里的蝶形运算单元，需要用到加法器，减法器，二选一选择器-FFT module of butterflies, need to use an adder, a subtracter, a second election selector
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.
fft
- 用c语言写的FFT算法，包含了倒序，蝶形和最后的结果输出-C language written by the FFT algorithm, including the reverse, butterfly, and the final result output