Note: X()=4 when =0
Cannot Recover the original x[n] in this case
original x[n] is recovered in this case
original x[n] is recovered in this case
The 8 point DFT provides the best spectral representation overall. However the 4 point DFT would suf
EE341, Autumn 2007 Problem Set 7 SOLUTION
Reading for this problem set: Chapter 12 of Signals, Systems, and Transforms. 1. The signal x(t) = 5 cos(8t) is sampled eight times with T = 0.1s, starting at t = 0. solution
(a) Compute the DFT of this sequ
EE341, Autumn 2007 Problem Set 5 SOLUTION
Reading for this problem set: Sections 12.1 - 12.3 of Signals, Systems, and Transforms. 1. Prove that: DT F{nx[n]} = j solution By definition,
dX() d
X() =
n=-
x[n]e-jn
d d x[n]e-jn X() = d d n=- Becaus
EE341, Autumn 2007 Problem Set 3 SOLUTION
Reading for this problem set: Chapter 10 of Signals, Systems, and Transforms. 1. Show that, for any function g[n], g[n] [n] = g[n] solution From the definition of the convolution sum,
g[n] [n] =
k=-
g[k]
EE341, Autumn 2007 Problem Set 1 SOLUTION (updated 8th October)
Reading for this problem set: Chapter 9 of Signals, Systems, and Transforms. 1. The following is the graph of a signal x[n].
4 3 2 1
-1
1 0
3
-4
-3
-2 -1 -2
2
4
5
6
-1
Assum