(New page: Category:ECE438Fall2011Boutin Category:problem solving = Discrete-time Fourier transform computation = Compute the discrete-time Fourier transform of the following signal: <math> ...)
 
Line 1: Line 1:
 +
[[Category:ECE438]]
 
[[Category:ECE438Fall2011Boutin]]
 
[[Category:ECE438Fall2011Boutin]]
 
[[Category:problem solving]]
 
[[Category:problem solving]]

Revision as of 11:27, 2 September 2011

Discrete-time Fourier transform computation

Compute the discrete-time Fourier transform of the following signal:

$ x[n]= u[n]-u[n-3] $

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

Answer 3

write it here.


Back to ECE438 Fall 2011 Prof. Boutin

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood