搜索资源列表
FFTModify
- 用能量重心法，对基2分裂的FFT算法进行校正，在整周期采样的条件下，幅值，相位，频率等可以达到很高的精度 -energy center, two pairs of split-the FFT algorithm for correction, in the whole cycle of sampling conditions, the amplitude, phase, frequency, etc., may achieve high accuracy
FFTandIFFT
- 三类FFT变换(时域基2，频域基2，分裂基)及其反变换
Split_radix
- FFT的分裂基算法，很详细的注释，花了两天的时间。希望对大家有帮助-The Split-radix FFT algorithm, a very detailed notes, spent a couple of days. We want to help
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
splfft
- 分裂基算法，已调试，用C语言实现-Split-radix algorithm, have been debug using C language. . . . . . . . . . . . .
FFT
- 利用分裂基方法实现快速傅里叶变换的CPP文件-The use of split-based methods for fast Fourier transform CPP file
fljFFT
- c语言环境下编写的利用分裂基算法求复序列 的DFT -c language environment, the use of split-based algorithm for the preparation of complex sequence of DFT requirements
splitFFT
- 应用c实现的分裂基fft算法，希望对你有帮助。分裂基快速傅立叶变换-Separatist base application c achieve fft algorithm。
srfft
- 计算复序列的分裂基快速傅里叶变换，分裂基快速算法是将基2和基4分解组合而成。在基2M类快速算法中，分裂基算法具有最少的运算量，且仍保留结构规则、原位计算等优点。-Calculate complex sequence of split radix fast Fourier transform, fast algorithm is to split the base base 2 and base 4 decomposition combination. 2M fast algorithm in t