搜索资源列表
离散傅里叶变换，即DFT
- 离散傅里叶变换，即DFT, 注意：FFT在matlab里有现成的函数可以用，它只是DFT快速实现的一种方法而已。,DFT： Discrete Fourier transform.
FFT.rar
- 用VC++实现的快速傅里叶变换的源代码，开发平台是VC++6.0,this is fft which effects in image by vc++
frft_Ozaktas.快速分数阶傅里叶变换程序
- Ozaktas 的快速分数阶傅里叶变换程序
FFT(DFTrealarray)twodimension
- 多维傅里叶变换，二维DFT快速算法，共分五部--三：二维实序2D-DFT列行列算法-Multi-dimensional Fourier transform, fast algorithm for two-dimensional DFT is divided into 5- 3: two-dimensional real column ordinal ranks of 2D-DFT algorithm for
ERCoh2
- 对脑电信号进行滤波、快速傅里叶变换（FFT）及自相关、互相关计算，以观察每一通道脑电的相关性-On EEG filtering, fast Fourier transform (FFT) and autocorrelation, cross correlation calculation, in order to observe the correlation of each channel EEG
FFT_Convolution
- 快速傅里叶变换和离散线性褶积matlab程序，可以直接调用-Fast Fourier transform and discrete linear convolution matlab program, you can directly call
C_FFT_IFFT
- 这是快速傅里叶变换及逆变换的实现c代码，傅里叶变换是小波变换的基础更是图像及信号处理的基础-This is the fast Fourier transform and inverse transform of the realization of c code, Fourier transform is based on wavelet transform is the basis of image and signal processing
222
- 快速傅里叶变换(FFT)及其应用，这里是一些实例，包括调试好的程序和结果。-Fast Fourier transform (FFT) and its application, here are some examples, including debugging good program and results.
fft
- 一天征服傅里叶变换,超简单的描述，让没有基础的同学都能看的明白，适合还处在似懂非懂的状态的同志们。-One day conquer the Fourier transform, super simple descr iption, so there is no basis to understand the students can look for is still in the state of half-comprehended comrades.
fastpoisson
- 该方法 基于快速傅里叶变换，求解方形区域的poission方程 比差分 有限元快。
mallat
- 小波谱分析mallat算法经典程序 MALLET分解算法(圆周卷积的快速傅里叶变换实现)-Algorithm for spectral analysis mallat small program MALLET classic decomposition algorithm (circular convolution of the fast Fourier transform)
freqresponse
- matlab对信号的处理，主要是针对振动信号的处理，包括加速度积分到位移，时域经快速傅里叶变换到频域(The signal processing of MATLAB is mainly aimed at the processing of vibration signal, including acceleration integral to displacement, time domain and FFT to frequency domain)
kuaisufuliye
- 快速傅里叶变换 (fast Fourier transform), 即利用计算机计算离散傅里叶变换（DFT)的高效、快速计算方法的统称，简称FFT。(Fast Fourier transform, that is, the use of computer to calculate discrete Fourier transform (DFT) efficient and fast calculation methods collectively, referred to as FFT.)
sfft-code
- 稀疏快速傅里叶变换作为传统FFT的改进版，它充分利用输入信号频域稀疏特性，实现序列的快速傅里叶变换。(As an improved version of the traditional FFT, sparse fast Fourier transform takes full advantage of the sparse characteristics of the input signal frequency domain to achieve fast Fourier transform
一维快速傅里叶转换
- 泊松方程的解法，这是一个一维泊松方程，利用快速傅里叶变换方法解(The solution of Poisson equation, which is a one-dimensional Poisson equation, is solved by the fast Fourier transform method)
Radix2FFT原版
- 很多时候都会用到傅里叶变换来处理图像数据。可以通过C＋＋来有效的实现快速傅里叶变换。(to effectively implement the fast Fourier transform by C + +.)
FFT
- 在matlab中对振动信号实现快速傅里叶变换(The realization of fast Fourier transform for vibration signals in MATLAB)
快速傅里叶变换 c
- FFT的基本思想是把原始的N点序列，依次分解成一系列的短序列。充分利用DFT计算式中指数因子 所具有的对称性质和周期性质，进而求出这些短序列相应的DFT并进行适当组合，达到删除重复计算，减少乘法运算和简化结构的目的(Fast Fourier Transform)
1612_PCdisp_Update
- 转换时域信号为频域信号，快速傅里叶变换，取峰值频率反算厚度信息(Converting time-domain signals to frequency-domain signals)
matlabcode
- 图像傅里叶变换，图像的快速傅里叶变换，逆变换，图像的二维FFT变换可以观察图像的频谱，再进行逆变换即可复原图像(Image Fourier transform)