DISKRET TID FOURIER TRANSFORM dskret TID傅里叶变换.docVIP

DISCRETE TIME FOURIER TRANSFORM (DTFT) Introduction DTFT definition, Analysis and Synthesis Equation DTFT-Properties Connection between DTFT and DFT(or fft) DTFT examples and derived DFT of selected examples 1. Introduction The most general problem in Signal Analysis is the analysis of the frequency content of a continuous time signal – whether it is a received signal or an impulse response of an LTI system, which generally are neither finite or periodic and often random or stochastic of nature. Random signals we will prefer to characterize as a measurement. If the analysis is made on a computer we will have to ‘ trim a heel and cut a toe’ to make it work and recognize the errors and approximations this procedure involves. We can in the computer case only operate with finite and discrete signals, quantized to a prescribed number of bits. To analyze these effects we have to introduce a Fourier Transform valid for discrete, aperiodic signals: – The DTFT – and examine its properties. Further we need to mention the Fourier Transform of aperiodic continuous time signals.So far we have dealt with the following Transforms: Continuous Periodic Time Signals. The tool in this case is the Analysis and Synthesis equations of the Fourier Series. We observed here that the Spectrum turned out to be discrete and aperiodic – containing solely the harmonics of the so-called fundamental harmonic with frequency f= 1/T ( this is Planche 1 in the Fourier Outline of the FStoDFT-note), where T is the time period of the signal. The discrete spectrum was a consequence of the periodicity and we have the completely general rule: Periodic in one domain = Discrete in the other domain…and vice versa For c.t. signals we have not mentioned the Fourier Transform ( Planche II in the outline), which is a generalization of the Fourier Series extended to aperiodic signals in - ( t ( . It turns out to be a ’continuous frequency’ signal with continuous frequency values equal to the ana