fft算法的c程序实现-----外文翻译.doc
约10页DOC格式手机打开展开
fft算法的c程序实现-----外文翻译,1.developing of fftfinite sequence of discrete fourier transform by (dft) will be separated into its frequency domain are finite sequences. but its calculation ...
内容介绍
此文档由会员 wanli1988go 发布
1.Developing of FFT
Finite sequence of discrete Fourier transform by (DFT) will be separated into its frequency domain are finite sequences. But its calculation is too big, difficult to deal with the problem in real time, it leads to a fast Fourier transform (FFT). In 1965, Cooley and Tukey proposed calculation of discrete Fourier transform (DFT) of the fast algorithm, the DFT computation to reduce the number of orders of magnitude. Since then, the fast Fourier transform (FFT) algorithm will continue in-depth, digital signal processing with this emerging disciplines, with the FFT and the emergence and development of rapid development. Based on the sequence of decomposition and the different selection methods produced a variety of FFT algorithms, the basic algorithm is based 2DIT and base 2DIF. FFT in the Fourier inverse transform, linear convolution and linear correlation also has important applications.
1．FFT的发展
有限长序列可以通过离散傅立叶变换(DFT)将其频域也离散化成有限长序列.但其计算量太大,很难实时地处理问题,因此引出了快速算法傅立叶变换(FFT). 1965年，Cooley和Tukey提出了计算离散傅立叶变换（DFT）的快速算法，将DFT的运算量减少了几个数量级。从此，对快速傅立叶变换（FFT）算法的研究便不断深入，数字信号处理这门新兴学科也随FFT的出现和发展而迅速发展。根据对序列分解与选取方法的不同而产生了FFT的多种算法，基本算法是基２DIT和基２DIF。FFT在离散傅立叶反变换、线性卷积和线性相关等方面也有重要应用。
Finite sequence of discrete Fourier transform by (DFT) will be separated into its frequency domain are finite sequences. But its calculation is too big, difficult to deal with the problem in real time, it leads to a fast Fourier transform (FFT). In 1965, Cooley and Tukey proposed calculation of discrete Fourier transform (DFT) of the fast algorithm, the DFT computation to reduce the number of orders of magnitude. Since then, the fast Fourier transform (FFT) algorithm will continue in-depth, digital signal processing with this emerging disciplines, with the FFT and the emergence and development of rapid development. Based on the sequence of decomposition and the different selection methods produced a variety of FFT algorithms, the basic algorithm is based 2DIT and base 2DIF. FFT in the Fourier inverse transform, linear convolution and linear correlation also has important applications.
1．FFT的发展
有限长序列可以通过离散傅立叶变换(DFT)将其频域也离散化成有限长序列.但其计算量太大,很难实时地处理问题,因此引出了快速算法傅立叶变换(FFT). 1965年，Cooley和Tukey提出了计算离散傅立叶变换（DFT）的快速算法，将DFT的运算量减少了几个数量级。从此，对快速傅立叶变换（FFT）算法的研究便不断深入，数字信号处理这门新兴学科也随FFT的出现和发展而迅速发展。根据对序列分解与选取方法的不同而产生了FFT的多种算法，基本算法是基２DIT和基２DIF。FFT在离散傅立叶反变换、线性卷积和线性相关等方面也有重要应用。
