《测试信号》教学课件Chapter3_Lec2_part1.ppt

Sampling the DTFT To apply to finite-length sequences, we assume that the samples outside the specified range are zeros Thus if x[n] is a length-M sequence with , then y[n] = x[n] for * Sampling the DTFT If N M, there is a time-domain aliasing of samples of x[n] in generating y[n], and x[n] cannot be recovered from y[n] Example - Let By sampling its DTFT at , and then applying a 8-point IDFT to these samples, according to last slide, we arrive at the sequence y[n] given by * Sampling the DTFT y[n]=x[n]+x[n+8]+x[n-8],0=n=7 ?{y[n]}={0 1 2 3 4 5 0 0} By sampling its DTFT at , and then applying a 4-point IDFT to these samples, we arrive at the sequence y[n] given by * Sampling the DTFT , i.e. {x[n]} cannot be recovered from {y[n]} * Sampling theory in frequency domain: x[n] — length-M N — DFT parameter DFT Properties Like the DTFT, the DFT also satisfies a number of properties that are useful in signal processing applications Some of these properties are essentially identical to those of the DTFT, while some others are somewhat different A summary of the DFT properties are given in tables in the following slides * General Properties of DFT * two errors in book! DFT Properties: Symmetry Relations x[n] is a complex sequence * DFT Properties: Symmetry Relations x[n] is a real sequence * DFT Applications Numerical Computation of the DTFT for discrete-time signal Using the DFT Digital spectrum analysis of continuous-time signal Using the DFT Linear Convolution Using the DFT * Numerical Computation of the DTFT Using the DFT A practical approach to the numerical computation of the DTFT of a finite-length sequence Let be the DTFT of a length-N sequence x[n] We wish to evaluate on a dense grid of frequencies , , where M N: * 有限长序列的DF