中山大学信号与系统课件奥本海姆英文版课后答案chapter2.docVIP

Chapter 2 answers 2.1 (a) We have know that The signals x[n] and h[n] are as how in Figure S2.1 From this figure, we can easily see that the above convolution sum reduces to This gives (b)We know that Comparing with eq.(S2.1-1),we see that (c) We may rewrite eq.(S2.1-1) as Similarly, we may write Comparing this with eq.(S2.1),we see that 2.2 Using given definition for the signal h[n], we may write The signal h[k] is non zero only in the rang . From this we know that the signal h[-k] is non zero only in the rage.If we now shift the signal h[-k] by n to the right, then the resultant signal h[n-k] will be zero in the range . Therefore , 2.3 Let us define the signals and . We note that and Now, By replacing k with m+2 in the abovr summation ,we obtain Using the results of Example 2.1 in the text book ,we may write 2.4 We know that The signals x[n] and y[n] are as shown in Figure S2.4.From this figure,we see that the above summation reduces to This gives 2.5．The signal y[n] is y[n]= x[n]h[n] = . In this case , this summation reduces to y[n]==. From this it is clear that y[n] is a summation of shifted replicas of h[n]. Since the last replicas will begin at n=9 and h[n] is zero for nN, y[n] is zero for nN+9. Using this and the fact y[14]=0,we may conclude that N can at most be 4. Furthermore ,since y[4]=5,we can conclude that h[n] has at least 5 non-zero points . The only value of N which satisfies both these conditions is 4. 2.6. From the given information, we have : y[n]= x[n]h[n] = . =. =. =. Replacing k by p-1, y[n]= = (S2.6-1) For n0 the above equation reduces to, y[n]= = For n0 eq.(S2.6-1) reduces to, y[n]==== Therefore, y[n]= 2.7.(a) Given that x[n]= [n-1], we