搜索资源列表
DSPPrograms
- DSP编程常用函数 double uniform(double a,double b,long int* seed) double gauss(double mean,double sigma,long int *seed) double exponent(double beta,long int *seed) double laplace(double beta,long int* seed) double rayleigh(double sigma,long int *seed) doubl
wfft
- 快速傅里叶变换是傅里叶变换的特例，本文档用汇编语言实现了快速傅里叶变换（即fft）-FFT is a particular case of DFT,The assembly realization of FFT is finished in this paper.
ee
- 快速傅立叶变换(FFT)是离散傅立叶变换的一种有效的算法，通过选择和重新排列中间结果，减小运算量。DFT有大量重复的cos、sin计算，FFT的作用就是用技巧减少cos、sin项重复计算。当采样点数为1024点,DFT要求一百万次以上计算量，而FFT则只要求一万次。-cout width cout width cout width cout width cout width cout width cout width cout width cout width cout width cout w
ThamKhaoCodeCaAssembly
- The FFT is based on decomposition and breaking the transform into smaller transforms and combining them to get the total transform. FFT reduces the computation time required to compute a discrete Fourier transform and improves the performance by a fa
slau213a
- The FFT is based on decomposition and breaking the transform into smaller transforms and combining them to get the total transform. FFT reduces the computation time required to compute a discrete Fourier transform and improves the performance by a fa
FFTinCyuyan
- c语言实现快速傅里叶变换，移植性较强。用结构体形式表示一个数（复数形式）-DFT，FFT ，Visual C/C++
FFT_CODE
- A fast Fourier transform (FFT) is an algorithm to compute the discrete Fourier transform (DFT) and its inverse. A Fourier transform converts time (or space) to frequency and vice versa an FFT rapidly computes such transformations. As a result, fast F
Desktop
- code for dft and padder and fft
fft
- C语言实现几种不同FFT的方法：其中包括时间抽取的基2 DFT，频率抽取的基2 DFT，分裂基算法、CZT方法等。-C language implementation of several different FFT approach: including the time taken by the base 2 DFT, frequency extraction base 2 DFT, split based algorithm, CZT methods.
DFT-AND-FFT
- DFT/FFT的物理意义讲解，本人觉得很不错！-The physical meaning of DFT/FFT to explain, I feel very good!
FTHarmonic
- this a analysed programmer of harmonic waves.it consist of FFT and DFT. a kind of frequency measurement is also included.-this is a analysed programmer of harmonic waves.it consist of FFT and DFT. a kind of frequency measurement is also included.
DFFT
- DFT运算的计时程序，可用于与FFT运算时间相比较-DFT operation of the timing program can be used to compare with the FFT computing time
STC_FFT
- 快速傅里叶变换法（FFT）是离散傅立叶变换的一种快速计算方法，它能使N点DFT的乘法计算量由N2 次降为 次。下图是采样点数为8点FFT时间抽取算法信号流图，本程序也是以这种形式设计的。-Fast Fourier Transform (FFT) is a fast computational method for discrete Fourier transforms that can reduce the multiplication of N-point DFT by N2 times. T
并行计算MPI程序设计
- FFT，即为快速傅氏变换，是离散傅氏变换的快速算法，它是根据离散傅氏变换的奇、偶、虚、实等特性，对离散傅立叶变换的算法进行改进获得的。它对傅氏变换的理论并没有新的发现，但是对于在计算机系统或者说数字系统中应用离散傅立叶变换，可以说是进了一大步。(FFT, that is fast Fourier transform, is a fast algorithm for discrete Fourier transform. It is based on the odd, even, imaginar