搜索资源列表
傅立叶
- 128点FFT算法,对4阶及以下处理.通过稍微修改源码(修改注释),即可以先产生一个序列,并随后进行FFT.-128-point FFT algorithm, the four bands and the following handling. Through slightly modified source (Alteration of the Notes), which can produce a first sequence, followed FFT.
WSWavelet
- 输入：小波分析的结果或傅立叶分析的结果 输出：图像（bmp） web服务-input : wavelet analysis results or Fourier analysis of the results output : images (bmp) web services
testwavelet
- 自己定义一个数组，模拟小波和傅立叶分析结果，调用webserice----WSWavelet生成图像-own definition of an array simulation wavelet and Fourier analysis, Call webserice-generated images WSWavelet
dsp_fft32x32
- DSP 快速傅立叶变换 c语言实现的-dsp FFT 32*32 c language relize ........
cPPFourier-transform
- c++傅立叶变换的代码实现，对图片进行傅立叶转换-Code c++ implementation of the Fourier transform of the Fourier transform image
上传程序
- buffer滤波器的设计，语音分帧 ，短时傅立叶变换的程序(buffer filter design and Speech sub-frame)
597102
- 分数阶傅立叶变换的各种程序,快速算法,线调频信号的处理等,()
ZOOM-FFT算法
- ZOOM-FFT称为细化的快速傅立叶变换，又称为选带快速傅立叶变换。ZOOM-FFT的功能是对信号的频率进行局部细化放大，使感兴趣的频带获得较高的频率分辨率。实现FFT细化功能的算法有几种，如频移法-、相位补偿法和最大熵谱法等，目前应用最关的是频移法(ZOOM-FFT is called a thinned Fast Fourier Transform, also known as Fast Fourier Transform. The function of ZOOM-FFT is to pa