搜索资源列表
fft_delphi
- A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse
dit_fft
- 本程序包括:DFT(离散傅里叶变换),FFT(快速傅里叶变换),IFFT(快速傅里叶逆变换),conv(卷积:圆周卷积、线性卷积),主要应用于信号处理,既可以对实序列做上述操作,也可以对复序列。-This process includes: DFT (Discrete Fourier Transform), FFT (fast Fourier transform), IFFT (inverse fast Fourier transform), conv (convolution: circula
DFT
- 计算单点DFT以及序列的DFT变换 计算单点逆DFT以及序列的逆DFT变换-Calculate single-point DFT and DFT-calculated sequence of single-point inverse DFT and inverse DFT transform sequence
cpp
- dft idft fft ifft的c++源码实现 离散时间傅里叶变换 极其逆变换实现 快速傅里叶变换极其逆变换实现-dft idft fft ifft the c++ source to achieve extremely inverse discrete-time Fourier transform fast Fourier transform extremely inverse transform
Myproject
- 快速傅立叶变换(FFT)是一个有效的算法来计算离散傅立叶变换(DFT)及其逆。有很多不同的FFT算法,涉及范围很广,从简单的复数运算的数学组理论和数字理论,这里我给大家带来了一个能够进行快速傅里叶变换及其逆的程序,希望对大家能够有所帮助-A Fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are
DFT
- Visual C++实现数据的离散傅里叶变换及逆变换,并输出结果为Excel工作薄。 -Visual C++ achieve data of the discrete Fourier transform and inverse transform, and output the result to an Excel workbook.
dft
- 谐波叠加法计算激励谱并采用加窗傅立叶变换反算功率谱密度曲线-Harmonic superposition method to calculate the excitation spectrum, and windowed Fourier transform the inverse power spectral density curve