(One intermediate revision by the same user not shown) | |||
Line 1: | Line 1: | ||
+ | [[Category:ECE301Spring2011Boutin]] | ||
+ | [[Category:blog]] | ||
+ | |||
= Lecture 21 Blog, [[2011 Spring ECE 301 Boutin|ECE301 Spring 2011]], [[User:Mboutin|Prof. Boutin]] = | = Lecture 21 Blog, [[2011 Spring ECE 301 Boutin|ECE301 Spring 2011]], [[User:Mboutin|Prof. Boutin]] = | ||
Monday February 28, 2011 (Week 8) - See [[Lecture Schedule ECE301Spring11 Boutin|Course Schedule]]. | Monday February 28, 2011 (Week 8) - See [[Lecture Schedule ECE301Spring11 Boutin|Course Schedule]]. | ||
Line 12: | Line 15: | ||
**[[Fourier_transform_3numinusn_DT_ECE301S11|Compute the Fourier transform of 3^n u[-n]]] | **[[Fourier_transform_3numinusn_DT_ECE301S11|Compute the Fourier transform of 3^n u[-n]]] | ||
**[[Fourier_transform_cosine_DT_ECE301S11|Compute the Fourier transform of cos(pi/6 n).]] | **[[Fourier_transform_cosine_DT_ECE301S11|Compute the Fourier transform of cos(pi/6 n).]] | ||
+ | **[[Fourier_transform_window_DT_ECE301S11|Compute the Fourier transform of u[n+1]-u[n-2]]] | ||
== Relevant Rhea Pages== | == Relevant Rhea Pages== |
Latest revision as of 13:13, 28 February 2011
Lecture 21 Blog, ECE301 Spring 2011, Prof. Boutin
Monday February 28, 2011 (Week 8) - See Course Schedule.
In the first part of today's lecture, we finished discussing the properties of the continuous-time Fourier transform. We then used these properties to obtain a simple expression for the frequency response of a causal LTI system defined by a differential equation.
In the second part of the lecture, we began covering chapter 5, which is about the discrete-time Fourier transform. We gave the definition for the discrete-time Fourier transform and its inverse. We pointed out the linearity property of the discrete-time Fourier transform. We also observed that the discrete-time Fourier transform is periodic with period $ 2 \pi $ and gave a mathematical proof of this fact. We then considered the problem of obtaining an expression for the Fourier transform of a periodic discrete-time signal. We noticed that the summation formula diverges in this case. However, using the linearity property of the discrete-time Fourier transform, we were able to reduce the problem to that of finding the Fourier transform of a discrete-time complex exponential. We then "guessed" what the Fourier transform of a discrete-time complex exponential should be. Our guess was somewhat wrong because it was not periodic with period $ 2 \pi $. We fixed that problem by adding an infinite number of shifted copies (shifted by $ 2 \pi k $, with k integer)of our signal.
Action items before the next lecture:
- Read Sections 5.4, 5.5 and 5.6 in the book.
- Solve the following practice problems on computing the Fourier transform of a discrete-time signal:
Relevant Rhea Pages
Previous: Lecture 20
Next: Lecture 22