FFt
快速傅里叶变换(fastFouriertransform),即利用计算机计算离散傅里叶变换（DFT)的高效、快速计算方法的统称，简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少，特别是被变换的抽样点数N越多，F...
资源总数
1,429
FFt 热门资料
Traffic sign shape classification based on Support Vector Machines and the FFT of the signature of b
Traffic sign shape classification based on Support Vector Machines and the FFT of the signature of blobs.pdf
2013-12-14
90
this file is even FFT, max point is 8192,this file "fft4g.c" is computer this file "how_to_use_fft.c
this file is even FFT, max point is 8192,this file "fft4g.c" is computer this file "how_to_use_fft.c" is call function "...
2014-01-14
189