第8章_离散傅立叶变换-v1.0.ppt

Circular Convolution by DFT Therefore Likewise, Circular Convolution by DFT Hence, The two 4-point DFTs can also be computed using the matrix relation given earlier Circular Convolution by DFT D4 is the 4-point DFT matrix Circular Convolution by DFT If YC[k] denotes the 4-point DFT of yC[n] then we obserbe YC[k]=G[k]H[k], 0≤k≤3 Thus Circular Convolution by DFT A 4-point IDFT of YC[k] yields §5.9 Computation of the DFT of Real Sequences So, the symmetry properties of the DFT are more efficient to compute DFT The DFTs of two N-point real sequences can be computed from a length-N complex sequences. And a 2N-point DFT of a length-2N real sequence can be determined from a length-N complex sequences. §5.9.1 N-Point DFTs of Two Real Sequences Using a Single N-Point DFT Let g[n] and h[n] be two real sequences of length each, with G[K] and H[k] de-noting their respective N-point DFTs. So, we have Then, we can get from Table5.1 §5.9.2 2N-Point DFT of a Real Sequences Using a Single N-Point DFT Let v[n] be a real sequence of length 2N with V[k] denoting its 2N-point DFT. Then we can define two real sequences g[n] and h[n] of length N each as: So, we can express the 2N-point DFT V[k] and in the next slide, we will show it. G[k] and H[k] can be determined from last section by (5.118) and (5.119) So, Important ! Review of Linear Convolution Using DTFT 1) Compute the DTFTs X(ej?) and H(ej?) of the sequences x[n] and h[n], respectively 2) Form the DTFT Y(ej?) = X(ej?) H(ej?) 3) Compute the IDTFT y[n] of Y(ej?) x[n] h[n] y[n] DTFT DTFT IDTFT X(ej?) H(ej?) Y(ej?) Review of Linear Convolution Using DTFT An important property of the DTFT is given by the convolution theorem It states that if y[n] = x[n]*h[n], then the DTFT Y(ej?) of y[n] is given by Y(ej?) = X(ej?) H(ej?) An implication of this result is that the linear convolution y[n] of the sequences x[n] and h[n] can be performed as follows: Linear convolution ① time reversal ,