| Line 21: | Line 21: | ||
--[[User:Cmcmican|Cmcmican]] 19:57, 28 February 2011 (UTC) | --[[User:Cmcmican|Cmcmican]] 19:57, 28 February 2011 (UTC) | ||
| + | :TA's comments: You have a small mistake in that. Note that <math>u[n-2]</math> starts at <math>n=2</math> and not <math>n=3</math>. | ||
=== Answer 2 === | === Answer 2 === | ||
Revision as of 15:18, 1 March 2011
Contents
Practice Question on Computing the Fourier Transform of a Discrete-time Signal
Compute the Fourier transform of the signal
$ x[n] = u[n+1]-u[n-2].\ $
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
$ \mathcal X (\omega) = \sum_{n=-\infty}^\infty (u[n+1]-u[n-2])e^{-j\omega n}=\sum_{n=-1}^2 e^{-j\omega n}= $
$ \mathcal X (\omega) = e^{j\omega}+1+e^{-j\omega}+e^{-j2\omega} $
--Cmcmican 19:57, 28 February 2011 (UTC)
- TA's comments: You have a small mistake in that. Note that $ u[n-2] $ starts at $ n=2 $ and not $ n=3 $.
Answer 2
Write it here.
Answer 3
Write it here.
