FFt
快速傅里叶变换(fastFouriertransform),即利用计算机计算离散傅里叶变换（DFT)的高效、快速计算方法的统称，简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少，特别是被变换的抽样点数N越多，F...
共 1,445 份资源
FFt 全部资料 1,445 份
PDF文档
Compute the matrix of mel filter coefficients given the sampling frequency, the length of the FFT an
Compute the matrix of mel filter coefficients given the sampling frequency, the length of the FFT an...
PDF文档
VLSI implementation of high speed and high resolution FFT algorithm based on Radix 2 for DSP applica
VLSI implementation of high speed and high resolution FFT algorithm based on Radix 2 for DSP applica...