| (21 intermediate revisions by the same user not shown) | |||
| Line 9: | Line 9: | ||
These are given without guarantee of correctness. If you see a typo or error, please let me know. | These are given without guarantee of correctness. If you see a typo or error, please let me know. | ||
---- | ---- | ||
| + | |||
| + | * [[Media:ECE301Summer2016_Aug01.pdf|Mon Aug 1st]] | ||
| + | |||
| + | * [[Media:ECE301Summer2016_Jul28.pdf|Thu Jul 28th]] | ||
| + | |||
| + | * [[Media:ECE301Summer2016_Jul27.pdf|Wed Jul 27th]] | ||
| + | ** Moving from sampling a CT signal to a discrete time sequence. | ||
| + | |||
| + | * [[Media:ECE301Summer2016_Jul21.pdf|Thu Jul 21st]] | ||
| + | |||
| + | * [[Media:ECE301Summer2016_Jul20.pdf|Wed Jul 20th]] | ||
| + | ** [[Media:ece301Summer2016_samplingExample.zip| Code]] for sampling a sine wave. | ||
| + | |||
| + | * [[Media:ECE301Summer2016_Jul19.pdf|Tue Jul 19th]] | ||
| + | |||
| + | * [[Media:ECE301Summer2016_Jul18.pdf|Mon Jul 18th]] | ||
| + | |||
| + | * [[Media:ECE301Summer2016_Jul15.pdf|Fri Jul 15th]] | ||
| + | |||
| + | * [[Media:ECE301Summer2016_Jul14.pdf|Thu Jul 14th]] | ||
| + | ** This is a short lecture because of our quiz. | ||
| + | |||
| + | * [[Media:ECE301Summer2016_Jul13.pdf|Wed Jul 13th]] | ||
| + | |||
| + | * [[Media:ECE301Summer2016_Jul11.pdf|Mon Jul 11th]] | ||
| + | |||
| + | * [[Media:ECE301Summer2016_Jul08.pdf|Fri Jul 8th]] | ||
| + | ** [[Media:classMovingAverage.zip| Code]] to plot the moving average. | ||
| + | |||
| + | * [[Media:ECE301Summer2016_Jul07.pdf|Thu Jul 7th]] | ||
| + | ** [[Media:euler.png|Plot]] of the complex exponential. Modified matlab [[Media:classExample_jun07.zip| code]]. | ||
| + | |||
| + | * [[Media:ECE301Summer2016_Jul06.pdf| Wed Jul 6th]] | ||
| + | |||
| + | * [[Media:ECE301Summer2016_Jul05.pdf| Tue Jul 5th]] | ||
| + | ** Fourier series representation of CT periodic signals and FS properties. | ||
| + | |||
| + | * [[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]]. | ||
| + | |||
| + | * Tue Jun 28th | ||
| + | ** 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). | ||
* [[Media:ECE301Summer2016_Jun24.pdf| Friday June 24th]] | * [[Media:ECE301Summer2016_Jun24.pdf| 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. | ** 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 == | == Discussions == | ||
Latest revision as of 20:09, 1 August 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.
- Wed Jul 27th
- Moving from sampling a CT signal to a discrete time sequence.
- Wed Jul 20th
- Code for sampling a sine wave.
- Thu Jul 14th
- This is a short lecture because of our quiz.
- Fri Jul 8th
- Code to plot the moving average.
- 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.
- 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.
