| Line 25: | Line 25: | ||
===Answer 2=== | ===Answer 2=== | ||
| − | [[Image:green26_ece438_hmwrk3_rect.png| | + | [[Image:green26_ece438_hmwrk3_rect.png|480x320px]] |
<math>X_{2\pi}(\omega) = \sum_{n=-\infty}^{+\infty} x[n] e^{-j\omega n}</math> | <math>X_{2\pi}(\omega) = \sum_{n=-\infty}^{+\infty} x[n] e^{-j\omega n}</math> | ||
Revision as of 12:18, 12 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
$ \sum \sum_n^\infty x[n] \delta[n] $.
Answer 2
$ X_{2\pi}(\omega) = \sum_{n=-\infty}^{+\infty} x[n] e^{-j\omega n} $
$ = \sum_{n=-2}^{0} x[n] e^{-j\omega n} $
$ = e^{2j\omega} + e^{j\omega} + 1 $
Answer 3
Write it here.
