| Line 21: | Line 21: | ||
---- | ---- | ||
===Answer 1=== | ===Answer 1=== | ||
| − | + | ||
| + | blah. | ||
===Answer 2=== | ===Answer 2=== | ||
Revision as of 04:23, 11 September 2013
Contents
Practice Problem on Discrete-time Fourier transform computation
Compute the discrete-time Fourier transform of the following signal:
$ x[n]= u[n+2]-u[n-1] $
See these Signal Definitions if you do not know what is the step function "u[n]".
(Write enough intermediate steps to fully justify your answer.)
You will receive feedback from your instructor and TA directly on this page. Other students are welcome to comment/discuss/point out mistakes/ask questions too!
Answer 1
blah.
Answer 2
Write it here.
