数字信号处理教学课件（利强）5.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.