(New page: Category:ECE Category:ECE438 Category:2013_Fall_ECE_438_Boutin Category:problem solving Category:discrete time Fourier transform = [[:Category:Problem_solving|Practi...) |
|||
| Line 12: | Line 12: | ||
x[n]= u[n+2]-u[n-1] | x[n]= u[n+2]-u[n-1] | ||
</math> | </math> | ||
| + | |||
| + | See these [[SignalDefinitions|Signal Definitions]] if you do not know what is the step function "u[n]". | ||
(Write enough intermediate steps to fully justify your answer.) | (Write enough intermediate steps to fully justify your answer.) | ||
Revision as of 06:31, 2 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
Write it here.
Answer 2
Write it here.
