搜索资源列表
dit-dif-fft
- 快速傅立叶算法，按时间和按频率抽取的基2算法-Fast Fourier algorithm, time and frequency taken by the base 2 Algorithm
fft.rar
- FFT算法的基本原理是把长序列的DFT逐次分解为较短序列的DFT。按照抽取方式的不同可分为DIT-FFT（按时间抽取）和DIF-FFT（按频率抽取）算法。按照蝶形运算的构成不同可分为基2、基4、基8以及任意因子（2n,n为大于1的整数），基2、基4算法较为常用。,FFT algorithm is the basic principle of DFT successive long sequence is broken down into shorter sequences of DFT. In
fft
- 设计一个按照时间抽取的基2快速傅里叶变换（基2FFT-DIT）。输入倒位序，输出自然顺序-To design a time of extraction according to the base 2 Fast Fourier Transform (base 2FFT-DIT). Input inversion sequence, the output of natural order。
DIT_FFT_2
- 用matlab实现基2时间抽取快速傅里叶变换fft-Base 2 with matlab time taken to achieve the fast Fourier transform fft
fft
- fft算法的具体实现，应用基2法实现，有比较好的实验结果。-fft concrete realization of the algorithm, the application base 2 method achieved a relatively good results.
exp2_FFT_DIT
- 设计一个按照时间抽取的基2快速傅里叶变换（基2FFT-DIT）。输入倒位序，输出自然顺序。-To design a time of extraction according to the base 2 Fast Fourier Transform (base 2FFT-DIT). Input inversion sequence, the output natural order.
FFT
- FFT算法的基本原理是把长序列的DFT逐次分解为较短序列的DFT.按照抽取方式的不同可分为DIT-FFT(按时间抽取)和DIF-FFT(按频率抽取)算法.按照蝶形运算的构成不同可分为基2、基4、基8以及任意因子(2n,n为大于1的整数),基2、基4算法较为常-The FFT algorithm s basic principle is decomposes gradually long sequence DFT into short sequence DFT. different may div
ditfftbasedonmatlab
- 在matlab中实现时间抽取基2 FFT算法-Matlab achieve in the time taken from the base 2 FFT algorithm
ditfft
- 基2ditfft的matlab源程序，以及与matlab自带的fft函数工作效率的比较，附有.doc文档的说明。-2ditfft the matlab source code base, as well as built-in fft function matlab efficiency compared with. Doc document descr iption.
fft
- 基2分频与基于分裂基的fft的实现，特别是新型的倒序算法提高了程序的质量-Base 2-splitting based on the realization of fft-based, especially the new type of reverse algorithm to improve the quality of the procedures
FFT
- TMS320C5509A上实现基2 FFT算法源程序-TMS320C5509A achieve base 2 FFT algorithm source code
LLVFourierTransforms
- fft变换代码,采用基2的频率域变换代码.-fft transform code, the use of the base 2 of the frequency domain transform code.
flysf
- 这个傅立叶实例算法使用了基2、基3、基4、基5、基8、基10……混合算法，几乎可以计算任意长度的FFT。说明白点也就是当序列长度n为2、3、5、7、11等这些比较小的素数时，或者n的最大素因数<=37时，可计算这个序列的FFT。-The Fourier algorithm uses an instance of the base 2, base 3, base 4, base 5, base 8, base 10 ... ... hybrid algorithm can calculate
fft
- 快速傅立叶变换的matlab算法实现。（是一个按照时间抽取的基-2快速傅里（基-2 FFT-DIT）。输入倒位序，输出自然顺序。-Fast Fourier Transform algorithm matlab. (Which is a time of extraction in accordance with the base-2 Fast Fu-ri (base-2 FFT-DIT). Enter the inversion sequence, the output of natural or
fft-source
- 快速傅立叶变换（时域抽取基二fft）的源码的分析-Fast Fourier Transform (time-domain extraction base 2 fft) analysis of the source code
FFT
- 自己编写的一个基2时间分解的FFT，程序实现了基2的时间序列从时域到频域的转换。希望对大家有用-I have written the time of a radix-2 decomposition of the FFT, program implementation of the base 2 of the time series from time domain to frequency domain conversion. Want to be useful to everyone
fft
- 快速Fourier变换的代码，基2算法，且和原始定义的Fourier变换算法进行了对比。-Fast Fourier Transform code, the base 2 algorithm, and the original definition of the Fourier transform algorithm were compared.
fft_model
- 基二的16点，每点16位FFT计算的modelsim完整工程，可以直接仿真运行-The base 2 of the 16 points, each 16-point FFT calculation modelsim full engineering, simulation can be directly run
fft
- Matlab的FFT算法程序 里面有基2时间抽取的FFT 还有基2频率抽取的FFT -Matlab' s FFT algorithm which has taken the time base 2 radix-2 FFT have taken the FFT frequency
FFT
- 本程序对输入序列实现DIT-FFT基2算法(This program implements DIT-FFT base 2 algorithm for input sequence.)