文件名称:FFT
介绍说明－－下载内容均来自于网络，请自行研究使用
采用快速傅里叶变换能使计算机计算离散傅里叶变换所需要的乘法次数大为减少，特别是被变换的抽样点数N越多，FFT算法计算量的节省就越显著。-Using fast Fourier transform computer can calculate the number of multiplications needed for the discrete Fourier transform greatly reduced, especially sampling points N is transformed more and save FFT algorithm to calculate the amount of the more remarkable.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
FFT.m