数字信号处理英文版3离散时间信号的变换域表示.ppt

§3.5 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 Sample values of such sequences are equal to zero for values of n 0 and n≥N * §3.5 Circular Shift of a Sequence If x[n] is such a sequence, then for any arbitrary integer n0 , the shifted sequence x1[n] = x[n – n0] is no longer defined for the range 0≤n≤N-1 We thus need to define another type of a shift that will always keep the shifted sequence in the range 0≤n≤N-1 * §3.5 Circular Shift of a Sequence The desired shift, called the circular shift, is defined using a modulo operation: For n00 (right circular shift), the above equation implies * §3.5 Circular Shift of a Sequence Illustration of the concept of a circular shift * §3.5 Circular Shift of a Sequence As can be seen from the previous figure, a right circular shift by n0 is equivalent to a left circular shift by N-n0 sample periods A circular shift by an integer number greater than N is equivalent to a circular shift by ?n0? N * §3.5 Circular Shift of a Sequence x[n-1] x[n] x[n-1N] n=44=0 * §3.6 Circular Convolution This operation is analogous to linear convolution, but with a subtle difference Consider two length-N sequences, g[n] and h[n], respectively Their linear convolution results in a length-(2N-1) sequence yL[n] given by * §3.6 Circular Convolution In computing yL[n] we have assumed that both length-N sequences have been zero-padded to extend their lengths to 2N-1 The longer form of yL[n] results from the time-reversal of the sequence h[n] and its linear shift to the right The first nonzero value of yL[n] is yL[n]=g[0]h[0], and the last nonzero value is yL[2N-2]=g[N-1]h[N-1] * §3.6 Circular Convolution To develop a convolution-like operation resulting in a length-N sequence yC[n], we need to define a circular time-reversal, and then apply a circular time-shift Result