离散快速傅里叶变换算法在频谱分析中得到了广泛的应用，这种算法得到的计算结果是在整个频段上的频谱信息。
Discrete fast Fourier transform (FFT) has been widely applied to signal spectral analysis and can figure out the entire bandwidth spectrum of a signal.
针对测试环境中不平衡量信号的特点，提出了离散傅里叶变换快速算法，并在通用微机上实现。
According to the characteristics of unbalance signal, the fast algorithm of discrete Fourier transform (DFT) is presented and accomplished by using microcomputer.
快速傅里叶变换(FFT)是离散傅里叶变换(DFT)的快速算法。
Fast Fourier Transform (FFT) is a kind of fast computation method of Discrete Fourier Transform (DFT).
本文首先对傅立叶变换的性质做了详细介绍，其中包括离散傅里叶变换，快速傅立叶变换（FFT）以及基-2按时间抽取（DIT）的FFT算法；
Firstly , the properties of Fourier Transform, including discrete Fourier Transform, FFT and based-2 DIT FFT, are introduced in this paper;
本文首先对傅立叶变换的性质做了详细介绍，其中包括离散傅里叶变换，快速傅立叶变换（FFT）以及基-2按时间抽取（DIT）的FFT算法；
Firstly , the properties of Fourier Transform, including discrete Fourier Transform, FFT and based-2 DIT FFT, are introduced in this paper;
应用推荐