信号的DFT对其CFT逼近程度的研究  

Study on Signal DFT Approximation to Its CFT

作　　者：王长富[1] 唐建[1] 王文剑 李辉[1] 

机构地区：[1]中国科技大学电子科学与技术系

出　　处：《中国科学技术大学学报》1999年第3期350-356,共7页JUSTC

摘　　要：离散傅立叶变换（ＤＦＴ）或它的快速计算（ＦＦＴ）是信号分析与处理最有力的工具之一，但由于它是用为基频整数倍的Ｎ个频率分量去逼近实际信号的连续傅立叶变换（ＣＦＴ）的值，故用ＤＦＴ估计信号的频谱通常是近似的．本文不仅给出了信号的ＤＦＴ与其ＣＦＴ之间的关系式，而且在此基础上证明了用ＤＦＴ估计信号谱的近似性，给出了用ＤＦＴ精确估计整数频率和非整数频率信号的频谱方法．同时。Discrete Fourier Transform (DFT) or its Fast Fourier Transform (FFT) is one of most useful tools for signal analysis and processing. Suppose that signal duration is T, and 1/T is defined as fundamental frequency,an integer times of the fundamental frequency is called an integer frequency. Since signal DFT uses N integer frequency components to approach the values of its Continuous Fourier Transform (CFT) at the N integer frequencies, the DFT is usually approximate. The expression of relation between signal DFT and its CFT is derived, Based on this expression, the approximation by signal DFT to its CFT is analyzed, and a method is proposed for precisely estimating the spectrum of signals with integer and noninteger frequencies. In addition, the effects are discussed of window function shape and of adding zeroes behind data on estimating signal spectrum using DFT.

关 键 词：DFT CFT 逼近程度 信号处理 傅里叶变换 

分 类 号：TN911.72[电子电信—通信与信息系统]