摘要
提出一种快速傅里叶变换(FFT)的改进算法,该算法利用FFT的衰减特性,只需要对FFT算法做简单的变换,就可以有效地消除频谱泄漏分量,实现非整数次谐波的精确检测,克服了传统FFT的缺陷.该算法与加窗体FFT相比,具有相近的特性,在算法构造方面又比加窗体FFT算法更简单,因此该算法更加适合应用于存储资源有限的微处理器上.为证明该算法应用于微处理器的方便性,设计了一套基于数字信号处理(DSP)的谐波检测装置,并对该算法进行了验证.
An improvement of the fast Fourier transform （FFT） algorithm was presented, which uses the fast attenuation characteristic of Fourier transform. This algorithm can effectively eliminate leakage component spectrum, realize non-rounded harmonic precision testing and overcome the shortcomings of the traditional FFT, only by a simple transformation of FFT. Because this algorithm is more similar to but simpler than the form FFT in algorithm structure, it is more suitable for storage on microprocessors which are limited-resource. A harmonic detection device based on digital signal processing （DSP） was designed to prove that the algorithm is applied to the convenience of microprocessors.
出处
《北京科技大学学报》
EI
CAS
CSCD
北大核心
2008年第10期1194-1199,共6页
Journal of University of Science and Technology Beijing
