采用快速傅立叶变换(FFT)进行电力系统谐波分析时,需要对采样信号截断并离散化,从而导致频谱泄漏和栅栏效应。
Fast Fourier Transform (FFT) is inevitable to cause the spectrum leakage and fence effect because of truncation and discreteness in signal collection.
用快速离散傅立叶变换(FFT)的方法确定均衡器的初始抽头系数,它区别于目前常用的迭代算法。
Employing the Fast Fourier Transform Algorithm (FFT) to determine the initial tap coefficients of equalizers is fundamentally different from using the current iteration method.
戈泽尔算法是离散傅立叶变换的一种快速算法。
数字信号处理中标准的频谱分析方法是离散傅立叶变换(DFT),典型的实现方法是快速傅立叶变换(FFT)。
The standard method for spectrum analysis in digital signal processing is the discrete Fourier transform(DFT), typically implemented using a fast Fourier transform(FFT) algorithm.
离散傅立叶变换方法能够在DSP平台上通过FFT快速实现,而循环相关方法则具有很高的频率估计精度和很好的抗噪性能。
DFT method can be fast implemented on DSP platform by the use of FFT algorithm, while the method of cyclic correlation has better noise immunity performance and high estimation accuracy.
本文首先对傅立叶变换的性质做了详细介绍,其中包括离散傅里叶变换,快速傅立叶变换(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;
应用推荐