| Line 10: | Line 10: | ||
---- | ---- | ||
| − | * | + | * [[Media:ECE301Summer2016_Jun29.pdf| Thu Jun 29th]] |
| + | ** Includes a list of what is covered on Exam 1, and some worked examples. | ||
| + | |||
| + | * Wed Jun 29th | ||
** Extra notes on [[Media:ECE301Summer2016_Prob2_22e.pdf| problem 2.22e]]. | ** Extra notes on [[Media:ECE301Summer2016_Prob2_22e.pdf| problem 2.22e]]. | ||
| − | * | + | * Tue Jun 28th |
** Mainly looked at some examples from the homework. They will be revisited on Wednesday. | ** Mainly looked at some examples from the homework. They will be revisited on Wednesday. | ||
| − | |||
| − | |||
** Here is the [[Media:ECE301_FSClassExample.zip| matlab example]] that was run in class (with some additional comments). | ** Here is the [[Media:ECE301_FSClassExample.zip| matlab example]] that was run in class (with some additional comments). | ||
Revision as of 17:04, 30 June 2016
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.
- Thu Jun 29th
- Includes a list of what is covered on Exam 1, and some worked examples.
- Wed Jun 29th
- Extra notes on problem 2.22e.
- 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.
