1.

(a)

(b)

2.

3.
If y[n] is the linear convolution of h[n] and g[n],
y[n] = {1, 2, 3, 4, 4, 4, 2, 0, -2, -4, -4, -4, -3, -2, -1, 0}.

Starting with the convolution answer, we first time-alias down to 8 points by

adding the second half to the corresponding points in the first half:
Then, consider the DFT property: DFT{Y[n]} = Ny[<-k>N].
Using the DFT property,

4.
yr = y(5:5+8-1);
he_tmp = ifft(fft(yr)./fft(x));
he = he_tmp(1:4)

5.
∞ 
(a)     
  ∞
      =      
  
=          ,  ≤  ≤  .


(b)          ,  ≤  ≤  .


   

  

     ==>         ↔       , where  = 1024.


            ,  ≤  ≤  .
