电子科技大学《数字信号处理》Chapter5第四版.pptVIP

Let g[n] and h[n] be two finite-length sequences of length N and M, respectively Denote L = N+M-1 Define two length-L sequences Then yL[n] = g[n]*h[n] = yC[n] = ge[n]*he[n] The corresponding implementation scheme is illustrated below We next consider the DFT-based implementation of * where h[n] is a finite-length sequence of length M and x[n] is an infinite length (or a finite length sequence of length much greater than M). L-point Circular Convolution When , (zero-padding). In fact, This is the requirement if linear convolution is computed by using DFT. when , .There is overlap. Example sketch * Homework Read textbook from p277 to 319 Problems 5.8, 5.12, 5.36, 5.40, 5.42, 5.50, 5.62 M5.2,M5.9,M5.10 Hence, The two 4-point DFTs can also be computed using the matrix relation given earlier D4 is the 4-point DFT matrix If YC[k] denotes the 4-point DFT of yC[n] then we obserbe YC[k]=G[k]H[k], 0≤k≤3 Thus A 4-point IDFT of YC[k] yields Example: Now let us extended the two length-4 sequences to length 7 by appending each with three zero-valued samples, i.e. We next determine the 7-point circular convolution of yC[n]=ge[n] ⑦ he[n]: From the above yC[0]=ge[0]he[0]+ ge[0]he[0]+ ge[0]he[0]+ ge[0]he[0]+ ge[0]he[0]+ ge[0]he[0] =g[0]h[0]=1?2=2 Continuing the process we arrive at yC [1] =g[0]h[1]+ g[1]h[0] =(1?2)+(2 ? 2)=6 yC [2] =g[0]h[2]+g[1]h[1] +g[2]h[0] =(1?1)+(2?2)+(0?2)=5 yC [3] =g[0]h[3]+g[1]h[2]+ g[2]h[1]+ g[3]h[0] =(1?1)+(2?1)+(0?2)+(1?2)= 5 yC [4] =g[1]h[3]+g[2]h[2]+ g[3]h[1] =(2?1)+(0?1)+(1?2)= 4 yC [5] =g[2]h[3]+g[3]h[2]=(0?1)+(1?1)=1 yC [6] =g[3]h[3]=(1?1) =1 As can be seen from the above that yC[n] is precisely the sequence yL[n] obtained by a linear convolution of g[n] and h[n] 0 1 2 3 4 5 6 2 6 5 4 1 yC[n] The N-point circular convolution can be written in matrix form