搜索资源列表
fft
- 数字信号处理（DSP）中快速傅立叶变换（基2）的算法。
fft-8
- 基于DSP的fft汇编程序，使用的是基-2法，以8点FFT为例
FFT
- FFT算法应用与C6000系列，基2算法。需要使用CCS
dit-dif-fft
- 快速傅立叶算法，按时间和按频率抽取的基2算法-Fast Fourier algorithm, time and frequency taken by the base 2 Algorithm
FFT 源程序
- c 语言的基2快速傅里叶变换程序
fft-ifft
- 用C语言实现了基2 DIT-FFT、DIF-FFT、DIT-IFFT和DIF-IFFT，而且运算点数可以自己设定，在vs2005下运行通过-2-based DIT-FFT、DIF-FFT、DIT-IFFT和DIF-IFFT with user-defined processing points are implemented using C, which has been run successfully in VS 2005.
fft
- 设计一个按照时间抽取的基2快速傅里叶变换（基2FFT-DIT）。输入倒位序，输出自然顺序。-Design is taken in accordance with the time radix-2 fast Fourier transform the (base 2FFT-DIT). Enter the inversion sequence, the output of the natural order.
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
- 基2算法的FFT程序，源码使用了按时间抽取的方式-Radix-2 algorithm the FFT procedure, the use of a time source selection
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
- 基于dsp的fft算法，是基2按时间抽取快速fft，对于想熟悉fft算法的朋友很有帮助-Based on the dsp of the fft algorithm, is extracted by time radix-2 fast fft, for want of a friend familiar with the fft algorithm helpful
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
LLVFourierTransforms
- fft变换代码,采用基2的频率域变换代码.-fft transform code, the use of the base 2 of the frequency domain transform code.
FFT
- 基2的FFT变换，带采样，结果输出到文件-fft program
FFT2
- 深刻理解DFT和基2-FFT的算法原理、编程思想，掌握C程序设计的基本技术。-A deep understanding of DFT and the 2-FFT-based algorithm, programming ideas, grasp the basic C programming techniques.
fft
- FFT 源码，根据书本上的FFT的基2算法编的-fft program,i do it myself
ADSP-21062_Compl_FFT_rad-4
- 用ADSP21062实现快速FFT基4算法 压缩包内有源代码和说明-In general, a radix-4 FFT will run faster than radix-2 FFT but will take up more space and has more restrictions on the length of the FFT. Specifically, all radix-2 FFT routines will take data lengths that are
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