+0  
 
0
436
0
avatar

Discrete time fourier transform for X(n)= [1 1 1 1], n= 0, 1, 2, 3

 
difficulty advanced
 Feb 4, 2015

3 Online Users

avatar
avatar
avatar