快速抗混叠傅立叶变换方法的误差分析(英文)

Error Analysis of Fast Anti-alias Fourier Transform

本文对快速抗混叠傅立叶变换算法 (FAFT)进行了误差分析 ,给出了它的误差估计。当用二次多项式分段逼近时 ,其频谱误差估计结果为 M2 4(TN) 3,其中 M为变换区间内被变换函数的三阶导数的最大值 ,N为样本数 。

This paper has succeeded in discussing the error analysis for Fast Anti alias Fourier Transform (FAFT). The analysis shows that the error of spectrum analyzing in FAFT is less than M24(TN) 3,where M is the maximum value of the three order derivative in a period of the transformed function, N the sample point number in a period,T the defined interval of the transformed function.