数字信号处理_ch5.ppt

Linear and circular convolutions but, actually DFT DFT x(n) h(n) × IDFT y(n) we implement the linear convolution by using the circular convolution. h(n) x(n) y(n) LTI linear convolution: circular convolution: (N points) length L length K length L+K-1 N points length N Sampling ( N samples in a period) N N if : aliasing if : not aliasing the condition that the circular convolution to be equivalent to the linear convolution is Notes that, L+K-1 is equals to the length of linear convolution. So, in order to perform a linear convolution using the IDFT of the product of the DFT of two sequences, we must choose a DFT size N satisfying the condition above. Example Compute the linear convolution of the two sequences x(n) and h(n), as well as the circular convolutions of x(n) and h(n) with different length N. L=4 K=3 First, we compute the linear convolution of x(n) and h(n) 4 3 2 1)0 1 1 1)0 4 3 2 1 4 3 2 1 4 3 2 1 4 7 9 6 3 1)0 and then compute circular convolution of length N=4 4 and then compute circular convolution of length N=6 6 and then compute circular convolution of length N=7 7 from example above, we can see that The circular convolution can equivalent to the linear convolution when and if NL+K-1, there happens aliasing, for example N=4 periodic repitition with period 4 + + = and then there have L+K-1-N aliasing points at head of sequence, 4+3-1-4=2 points in this example. 5.10.2 Method: Overlap-Add Method Overlap-Save Method Example Compute graphically the linear convolution of x(n) and h(n) in Figure below by splitting x(n) into blocks of two samples and using the overlap-and-add method. K=4 Splitting x(n) into blocks of two samples, so N=2 and N+K-1=5 Fourier Transform Classification Based on Conjugate Symmetry Circular even: Circular odd: Circular conjugate-symmetric: Circular conjugate-anti