| (17 intermediate revisions by 9 users not shown) | |||
| Line 6: | Line 6: | ||
[[Category:discrete time Fourier transform]] | [[Category:discrete time Fourier transform]] | ||
| − | = [[ | + | <center><font size= 4> |
| + | '''[[Digital_signal_processing_practice_problems_list|Practice Question on "Digital Signal Processing"]]''' | ||
| + | </font size> | ||
| + | |||
| + | Topic: Discrete-time Fourier transform computation | ||
| + | |||
| + | </center> | ||
| + | ---- | ||
| + | ==Question== | ||
Compute the discrete-time Fourier transform of the following signal: | Compute the discrete-time Fourier transform of the following signal: | ||
| Line 20: | Line 28: | ||
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! | 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=== | ===Answer 1=== | ||
| Line 32: | Line 39: | ||
<math>= 1+ e^{j\omega} + e^{2j\omega} </math> | <math>= 1+ e^{j\omega} + e^{2j\omega} </math> | ||
| + | :<span style="color:green"> Instructor's comment: Short and sweet. I like that. </span> | ||
===Answer 2=== | ===Answer 2=== | ||
| − | |||
| − | |||
[[Image:green26_ece438_hmwrk3_rect.png|480x320px]] | [[Image:green26_ece438_hmwrk3_rect.png|480x320px]] | ||
| Line 44: | Line 50: | ||
<math>= e^{2j\omega} + e^{j\omega} + 1</math> | <math>= e^{2j\omega} + e^{j\omega} + 1</math> | ||
| + | :<span style="color:green"> Instructor's comment: It does help to visualize the signal first. </span> | ||
===Answer 3=== | ===Answer 3=== | ||
| − | <math> | + | <math>X(\omega) = \sum_{n=-\infty}^{+\infty} (u[n+2] -u[n-1]) e^{-j\omega n}</math> |
<math>= \sum_{n=-2}^{+\infty} u[n+2] e^{-j\omega n} - \sum_{n=1}^{+\infty} u[n-1] e^{-j\omega n}</math> | <math>= \sum_{n=-2}^{+\infty} u[n+2] e^{-j\omega n} - \sum_{n=1}^{+\infty} u[n-1] e^{-j\omega n}</math> | ||
| − | + | ||
<math>= \sum_{n=-2}^{0} (u[n+2] -u[n-1]) e^{-j\omega n}</math> | <math>= \sum_{n=-2}^{0} (u[n+2] -u[n-1]) e^{-j\omega n}</math> | ||
<math>= e^{2j\omega} + e^{j\omega} + 1</math> | <math>= e^{2j\omega} + e^{j\omega} + 1</math> | ||
| + | |||
| + | :<span style="color:red"> TA's comment: When you write the summation from -2 to 0, you are implying that you've already used the information of the unit step function. So there's no point leaving that in the equation.</span> | ||
===Answer 4=== | ===Answer 4=== | ||
| Line 58: | Line 67: | ||
<math>x[n] = ((\delta[-2]) +(\delta[-1]) +(\delta[0])) </math> | <math>x[n] = ((\delta[-2]) +(\delta[-1]) +(\delta[0])) </math> | ||
| + | <span style="color:green">( Instructor's comment: The right-hand side does not depend on n. Unless your signal is constant, this means you made a mistake.)</span> | ||
| + | |||
| + | so <math> X[Z] = e^{2 j \omega} +e^{j \omega} +1 </math> | ||
| + | |||
| + | ===Answer 5=== | ||
| + | |||
| + | <math>x[n] = u[n+2] - u[n-1]</math> | ||
| + | |||
| + | <math>X_(\omega) = \sum_{n=-\infty}^{+\infty} x[n] e^{-j\omega n}</math> | ||
| + | |||
| + | <math>X_(\omega) = \sum_{n=-2}^{0} e^{-j\omega n}</math> | ||
| + | |||
| + | <math>X_(\omega) = 1 + e^{j\omega}+ e^{2j\omega} </math> | ||
| + | |||
| + | ===Answer 6=== | ||
| + | Xiang Zhang | ||
| + | |||
| + | |||
| + | from the equation we can get that | ||
| + | |||
| + | <math> | ||
| + | X(n) = u[n+2] - u[n-1] = \left\{ | ||
| + | \begin{array}{l l} | ||
| + | 1 & \quad when \quad n = -2,-1,0\\ | ||
| + | 0 & \quad \text{else} | ||
| + | \end{array} \right. | ||
| + | </math> | ||
| + | |||
| + | Hence, substitute into the DTFT equation, | ||
| + | |||
| + | <math> X_(\omega) = \sum_{n = -\infty}^{ \infty} x[n] e^{-j\omega n} | ||
| + | </math> | ||
| + | |||
| + | change the limit to | ||
| + | |||
| + | <math> X_(\omega) = \sum_{n = -2}^{ 0} e^{-j\omega n} | ||
| + | </math> | ||
| + | |||
| + | Then, we expand to the normal expression. | ||
| + | |||
| + | <math> X_(\omega) = 1 + e^{j \omega} + e^{j 2 \omega} | ||
| + | </math> | ||
| + | |||
| + | |||
| + | ===Answer 7=== | ||
| + | |||
| + | <math> X(\omega) = \sum_{n=-\infty}^\infty x[n]e^{-j2\omega n} </math> | ||
| + | |||
| + | <math> X(\omega) = e^{-j2\omega n}(\delta (n+2)-\delta (n+1)+\delta (n)) </math> | ||
| + | <span style="color:green"> (Instructor's comment: The right-hand-side depends on n, but the left-hand-side does not. This means you made a mistake.)</span> | ||
| + | |||
| + | <math> X(\omega) = e^{-j2\omega} + e^{-j\omega} + 1 \ </math> | ||
| + | |||
| + | ===Answer 8=== | ||
| + | |||
| + | x[n] = u[n+2]-u[n-1] | ||
| + | |||
| + | <math> X(\omega) = \sum_{n=-\infty}^\infty x[n]e^{-j\omega n} </math> | ||
| − | + | <math> = \sum_{n=-2}^0 x[n]e^{-j\omega n} </math> | |
| + | <math> = e^{j\omega 2}+e^{j\omega}+1 \ </math> | ||
| + | :<span style="color:red"> TA's comment: When you write the summation from -2 to 0, you are implying that you've already used the information of the inoput x[n]. So there's no point leaving that in the equation.</span> | ||
---- | ---- | ||
[[2013_Fall_ECE_438_Boutin|Back to ECE438 Fall 2013]] | [[2013_Fall_ECE_438_Boutin|Back to ECE438 Fall 2013]] | ||
Latest revision as of 11:36, 26 November 2013
Practice Question on "Digital Signal Processing"
Topic: Discrete-time Fourier transform computation
Contents
Question
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
$ 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} $
- Instructor's comment: Short and sweet. I like that.
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 $
- Instructor's comment: It does help to visualize the signal first.
Answer 3
$ X(\omega) = \sum_{n=-\infty}^{+\infty} (u[n+2] -u[n-1]) e^{-j\omega n} $
$ = \sum_{n=-2}^{+\infty} u[n+2] e^{-j\omega n} - \sum_{n=1}^{+\infty} u[n-1] e^{-j\omega n} $
$ = \sum_{n=-2}^{0} (u[n+2] -u[n-1]) e^{-j\omega n} $
$ = e^{2j\omega} + e^{j\omega} + 1 $
- TA's comment: When you write the summation from -2 to 0, you are implying that you've already used the information of the unit step function. So there's no point leaving that in the equation.
Answer 4
$ x[n] = u[n+2]-u[n-1] $
$ x[n] = ((\delta[-2]) +(\delta[-1]) +(\delta[0])) $
( Instructor's comment: The right-hand side does not depend on n. Unless your signal is constant, this means you made a mistake.)
so $ X[Z] = e^{2 j \omega} +e^{j \omega} +1 $
Answer 5
$ x[n] = u[n+2] - u[n-1] $
$ X_(\omega) = \sum_{n=-\infty}^{+\infty} x[n] e^{-j\omega n} $
$ X_(\omega) = \sum_{n=-2}^{0} e^{-j\omega n} $
$ X_(\omega) = 1 + e^{j\omega}+ e^{2j\omega} $
Answer 6
Xiang Zhang
from the equation we can get that
$ X(n) = u[n+2] - u[n-1] = \left\{ \begin{array}{l l} 1 & \quad when \quad n = -2,-1,0\\ 0 & \quad \text{else} \end{array} \right. $
Hence, substitute into the DTFT equation,
$ X_(\omega) = \sum_{n = -\infty}^{ \infty} x[n] e^{-j\omega n} $
change the limit to
$ X_(\omega) = \sum_{n = -2}^{ 0} e^{-j\omega n} $
Then, we expand to the normal expression.
$ X_(\omega) = 1 + e^{j \omega} + e^{j 2 \omega} $
Answer 7
$ X(\omega) = \sum_{n=-\infty}^\infty x[n]e^{-j2\omega n} $
$ X(\omega) = e^{-j2\omega n}(\delta (n+2)-\delta (n+1)+\delta (n)) $ (Instructor's comment: The right-hand-side depends on n, but the left-hand-side does not. This means you made a mistake.)
$ X(\omega) = e^{-j2\omega} + e^{-j\omega} + 1 \ $
Answer 8
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} $
$ = e^{j\omega 2}+e^{j\omega}+1 \ $
- TA's comment: When you write the summation from -2 to 0, you are implying that you've already used the information of the inoput x[n]. So there's no point leaving that in the equation.
