Revision as of 11:13, 27 June 2016 by Shenkt (Talk | contribs)


ECE301, Summer 2016, Trey E. Shenk

Lecture Notes

These are given without guarantee of correctness. If you see a typo or error, please let me know.


  • Friday June 24th
    • Note that there was a change to page 6 (the length of the output). It should be an equality (length(x[n]*h[n]) = length(x[n]) + length(h[n]) - 1). Also note that the upper bound of 14 came from y[14]=0, not the length of the sequences being convolved. More explanation has been added to the notes.

Discussions

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood