摘要
本文介绍了一种基于DFT滤波器组实现zoom—FFT算法,该算法是利用DFT滤波器组将待分析的信号带宽分解成多个子带,经过子带选择,再进行FFT运算。分析表明:该算法运算效率高,能实现运算量和运算精度的折衷;与Yip级连zoom—FFT算法比较,该算法有更大的适应性,Yip无修正级边zoom一FFT算法是该算法的一种特例,利用基于 DFT滤波器组实现 zppm一FFT算法可推导出 Yip无修正级边 zoom一FFT算法的通用修正公式;与复调制zoom一FFT算法比较,在保证同样精度的情况下,该算法运算量为复调制zoom-FFT算法运算量的1/M(M为子带细化倍数).
A zoom-FFT implementation based on DFT filter banks is introduced In this algorithm the sig- nal bandwidth is decomposed into many sub-bands by DFT filter banks FFT is used to calculate the local spec- trum after sub-band selecting ,After analyzing and comparison it is clear this algorithm is effective and prac- tical to realize the trade-off between complexity and more adaptive than Yip cascaded zoom-FFT algorithm While reserve the same calculation precision,the complexity of this algorithm is only about 1/M (M is the zoom--tims)of normal complex modulation zoom-FFT
出处
《信号处理》
CSCD
2000年第B12期122-127,共6页
Journal of Signal Processing