Line 21: Line 21:
 
----
 
----
 
===Answer 1===
 
===Answer 1===
 +
 +
Andrei Henrique Patriota Campos
  
 
<math> x[n] = u[n+2]-u[n-1]</math>.
 
<math> x[n] = u[n+2]-u[n-1]</math>.

Revision as of 14:12, 12 September 2013


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.)


Share your answers below

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

Andrei Henrique Patriota Campos

$ x[n] = u[n+2]-u[n-1] $.

$ X_(\omega) = \sum_{n=-\infty}^{+\infty} x[n] e^{-j\omega n} $

$ = \sum_{n=-2}^{0} x[n] e^{-j\omega n} $

$ = 1+ e^{j\omega} + e^{2j\omega} $


Answer 2

alec green

Green26 ece438 hmwrk3 rect.png

$ 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.


Back to ECE438 Fall 2013

Alumni Liaison

Questions/answers with a recent ECE grad

Ryne Rayburn