Revision as of 07:26, 2 September 2013 by Mboutin (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


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

(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

Write it here.

Answer 2

Write it here.


Back to ECE438 Fall 2013

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood