Revision as of 05:24, 11 September 2013 by Apatriot (Talk | contribs)


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

$ \sum \sum_n^\infty x[n] \delta[n] $.

Answer 2

Write it here.


Back to ECE438 Fall 2013

Alumni Liaison

BSEE 2004, current Ph.D. student researching signal and image processing.

Landis Huffman