《测试信号》教学课件Chapter3_Lec2_part2.ppt

Circular Shift of a Sequence circular shift (in graphic) Applications of DFT properties * * 模运算 * * The padded zeros force the replicas of h[-m] to be useless. * * * * 1）估计频率上限fm 及 2）频率fs 根据时域抽样定理，应当满足：fs ≥2 fh ，即1/T≥2 fh ，则T≤1/2fh 。 有的时候fh 的值并不清楚，可以先估计一个值，进行计算，若结果不理想，将fh 再增加一倍，再进行运算，直至满足要求为止。 * 3）数据长度T1 数据长度T1由于1/T1[F] ，要求频谱分辨力高，即[ F ]要小，则T1 应加长，只要有可能，T1尽量取大些。但T1 = NT ，T为采样间隔（周期），如果T1要大，而点数N不能增加，T就需要增加，这就意味着采样频率的下降，造成频谱混叠的加剧，这是需要注意的。 * 4）点数N 如上所述，如果一味追求高频谱分辨力，T不变，必然要增加N ，加大数据处理量。而N不增加，则T就需要增，就会加重频谱的混叠，因此对频谱分辨力的要求要适当。同时，由 * * 从而可知：若N不变，fh增加，[F]也增加，分辨力下降，相反N不变，fh 减小，分辨力提高，因此fh 的高低，直接影响分辨力，fh称为高频容量。 5）选窗口 为了减小频谱泄漏误差，通常可以选择适当的窗函数来解决。如果待分析的信号无需截断，就不必加窗 * Linear Convolution Using DTFT x[n] h[n] y[n] DTFT DTFT IDTFT * = x[n] h[n], * DFT Properties * x[n] h[n] y[n] DFT DFT IDFT ? Linear convolution Circular convolution ? Circular Shift of a Sequence Consider length-N sequences defined for Sample values of such sequences are equal to zero for values of n 0 and * Circular Shift of a Sequence If x[n] is such a sequence, then for any arbitrary integer , the shifted sequence is no longer defined for the range We thus need to define another type of a shift that will always keep the shifted sequence in the range * Circular Shift of a Sequence The desired shift, called the circular shift, is defined using a modulo operation: modulo operation mN=m modulo N, Let r=mN, then r = m + iN, where i is an integer chosen to make m+iN is a number between 0 and N-1. 257=4 -167=5 * Circular Shift of a Sequence * Circular Shift of a Sequence Illustration of the concept of a circular shift * Circular Shift of a Sequence As can be seen from the previous figure, a right circular shift by is equivalent to a left circular shift by sample periods A circular shift by an integer number greater than N is equivalent to a circular shift by * Circular Convolution This operation is analogous to linear convolution, but with a subtle difference