摘要
提出了一种固定结构的快速傅立叶变换(FFT)改进算法,通过改变蝶形结构使运算过程中的每一级结构保持相同,从而减少中间结果的存取寻址时间,达到简化运算步骤、提高运算效率的目的。用此算法对一数控磨床的机械故障信号进行分析,顺利诊断出故障原因和所在位置,为排除故障提供了依据。与经典FFT算法相比,效率提高大约7.23%,表明该算法具有一定的实用性和有效性。
A Fixed Structure FFT Algorithm （FS-FFT） was introduced. Changing the butterfly shape into a fixed structure, the same structure on each level can be formed. Address manipulation times to data registers can be reduced obviously, consequently, improve FFT speed. Experiments on numerical control grinder fault diagnoses have been applied, and experiment results show its practicability and validity. The efficiency of this algorithm can be improved about 7.23% than classical FFT.
出处
《计算机应用》
CSCD
北大核心
2006年第2期448-450,共3页
journal of Computer Applications
基金
教育部博士点基金(20040613013)
