文件名称:butterfly
介绍说明－－下载内容均来自于网络，请自行研究使用
计算离散傅里叶变换的一种快速算法,简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少,特别是被变换的抽样点数N越多,FFT算法计算量的节省就越显著。
-Discrete Fourier transform calculation of a fast algorithm, referred to as FFT. Fast Fourier Transform in 1965 by JW Cooley and TW map out Kormakiti. This algorithm enables calculation of discrete Fourier transform computer required a significant reduction in the number of multiplication, in particular by changing the sampling points N more, FFT algorithm for calculating the amount of savings will be significant.
-Discrete Fourier transform calculation of a fast algorithm, referred to as FFT. Fast Fourier Transform in 1965 by JW Cooley and TW map out Kormakiti. This algorithm enables calculation of discrete Fourier transform computer required a significant reduction in the number of multiplication, in particular by changing the sampling points N more, FFT algorithm for calculating the amount of savings will be significant.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
butterfly.v