数字信号处理a双语chapter5-finite-lengthdiscretetransformb-1140318.ppt

Chapter 5 Finite-LengthDiscrete Transforms Part B: Operations on Finite-Length Sequencesand DFT Properties Circular Time-reversal of a Sequence （Section 2.3.1 ） Circular Shift of a Sequence（Section 2.3.2 and 5.7 ） Circular Convolution（Section 5.4 and 5.7 ） Classification of Finite-Length Sequences ( Section 5.5) DFT Symmetry Relations and Theorems (Section 5.6 and 5.7) Fourier-Domain Filtering (Section 5.8) Computation of the DFT of Real Sequences (Section 5.9) Linear Convolution Using the DFT( Section 5.10) 1、Circular Time-Reversal Operation See in textbook Section 2.3.1 2、Circular Shift of a Sequence See in Section 2.3.2 and 5.7 2、Circular Shift of a Sequence This property is analogous to the time-shifting property of the DTFT, but with a subtle difference Consider length-N sequences defined for 0≤n≤N－1 2、Circular Shift of a Sequence 2、Circular Shift of a Sequence A circular shift by an integer number n0 greater than N is equivalent to a circular shift by n0N 2、Circular Shift of a Sequence 2、Circular Shift of a Sequence 3、Circular Convolution See in Section 5.4 and 5.7 3. Circular Convolution Circular convolution is analogous to linear convolution, but with a subtle difference Consider two length-N sequences, g(n) and h(n) respectively 3、Circular Convolution Example Determine the 4-point circular convolution of the two length-4 sequences: g[n]={1 2 0 1}, h[n]={2 2 1 1} as skecthed below 3、Circular Convolution The result is a length-4 sequence yC[n] From the above we observe 3、Circular Convolution Likewise, 3、Circular Convolution 循环卷积过程图解 3、Circular Convolution The circular convolution can also be computed using a DFT-based approach The N-point circular convolution can be written in matrix form as 3、Circular Convolution Note: 1、The element in each row of the matrix are obtained by circularly rotating the elements of the previous row to the right by one position. Such a matrix is called a cir