数字信号处理第5_1章.pptVIP

§5 Finite-Length DiscreteTransforms 5.1 DFS (Discrete Fourier Series) 1. Orthogonal Sequences Just like continuous periodic signal.where the orthogonal functions set is Example - Consider the length-N sequence defined for 0 ≤n ≤N-1 The N-point DFT of g[n] is thus given by Making use of the identity Example - Program 5_3.m can be used to compute the DFT and the DTFT of the sequence 5.3.2 Numerical Computation of the DTFT Using the DFT A practical approach to the numerical computation of the DTFT of a finite-length sequence x[n] We wish to evaluate X(ejω) at a dense grid of frequencies ωk=2πk/M, 0≤k ≤M-1, where MN: Thus X(ejωk) is essentially an M-point DFT Xe[k] of the length-M sequence xe[n] The DFT Xe[k] can be computed very efficiently using the FFT algorithm if M is an integer power of 2 The function freqz employs this approach to evaluate the frequency response at a prescribed set of frequencies of a DTFT expressed as a rational function in e-jω 5.3.3 DTFT from DFT by interpolation The N-point DFT X[k] of a length-N sequence X[n] is simply the frequency samples of its DTFT X(ejω) evaluated at N uniformly spaced frequency points ω=ωk=2πk/N, 0≤k≤N-1 Given the N-point DFT X[k] of a length-N sequence x[n], its DTFT X(ejω) can be uniquely determined from X[k] Thus To develop a compact expression for the sum S, let r=e-j(ω-2πk/N) Or, equivalently, S-rS=(1-r)S=1-rN Hence therefore 5.3.4 Sampling the DTFT Consider a sequence x[n] with DTFT X(ejω) We sample X(ejω) at N equally spaced points ωk=2πk/N, 0≤k≤N-1 developing the N frequency samples {X(ejωk)} These N frequency samples can be considered as an N-point DFT Y[k] whose N-point IDFT is a length-N sequence y[n] Now We arrive at the desired relation To apply If MN, 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 {x[n]}={0 1 2 3 4 5} ↑ By sampling its DTFT X(ejω) at ωk=2πk/4, 0≤k≤3 and