文件名称:STC_FFT
介绍说明--下载内容均来自于网络,请自行研究使用
快速傅里叶变换法(FFT)是离散傅立叶变换的一种快速计算方法,它能使N点DFT的乘法计算量由N2 次降为 次。下图是采样点数为8点FFT时间抽取算法信号流图,本程序也是以这种形式设计的。-Fast Fourier Transform (FFT) is a fast computational method for discrete Fourier transforms that can reduce the multiplication of N-point DFT by N2 times. The following figure is the sampling point of 8 points FFT time extraction algorithm signal flow diagram, the program is also designed in this form.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
STC_FFT.c