Revision as of 17:24, 27 July 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.


  • Wed Jul 27th
    • Moving from sampling a CT signal to a discrete time sequence.
  • Tue Jul 5th
    • Fourier series representation of CT periodic signals and FS properties.
  • Thu Jun 29th
    • Includes a list of what is covered on Exam 1, and some worked examples.
  • Tue Jun 28th
    • Mainly looked at some examples from the homework. They will be revisited on Wednesday.
    • Here is the matlab example that was run in class (with some additional comments).
  • 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