《测试信号》教学课件Chapter3-Lecture-2-Key-Points.pptx

Chapter 3 Discrete-Time Signals in the Transform DomainLecture 2Key PointsDiscretization in Time-domain and Frequency-domainTime-domainDTFTFrequency-domainSamplingSamplingDFT (using FFT)Discrete Fourier TransformDefinitionInverse discrete-time Fourier transformTransformation method NameTime domain??transform domainTransformation method Continuous-time Fourier Transform (CTFT)Discrete-Time Fourier Transform (DTFT)Discrete Fourier Transform (DFT)Discrete Fourier TransformSampling theory in frequency domainx[n] — length-M N — DFT parametery[n] — sequence by applying N-point IDFT on the N-point DFT of x[n]General Properties of DFTNumerical Computation of the DTFT Using the DFT1) Zero-padding (MN) 2) Compute M-point DFT of the length-M sequence - M is an integer power of 2 - use FFT to obtain DFT三一四二误差产生原因及解决办法谱分析时DFT参数的选择频域的有限化和离散化时域的有限化和离散化主要内容谱分析时DFT参数的选择1）估计待分析信号中频率范围和频率上限 。2）选定抽样频率 。3）根据分析精度，确定数据有效长度 。4）确定点数N。5）选窗口。 6）采样信号与长度为N的窗口相乘， 再利用FFT算法做N-point DFT。Circular time-domain operations画图法！！！Circular Shift of a SequenceCircular time-reversalCircular ConvolutionCondition of equivalence between circular convolution and linear convolutionSummaryProvided that the length of Circular Convolution is not less than N+M－1 where N and M are the lengths of the two sequences involved, the procedure of circular convolution is equivalent to that of linear convolutionLinear Convolution of Two Finite-Length SequencesLet g[n] and h[n] be two finite-length sequences of length N and M, respectivelyDenoteDefine two length-L sequencesZero-paddingg[n]withpoint DFTLength-N*point IDFTZero-paddingh[n]Lwithpoint DFTLength-MLength-Linear Convolution of Two Finite-Length SequencesThenThe corresponding implementation scheme is illustrated belowDFT parameter---NWhenever you need to apply DFT in signal analysis and processing, you should always ask yourself a question: what is the correct and the most appropriate parameter for applying DFT (i.e., ?-point DFT)? Because of the alising