(6 intermediate revisions by one other user not shown)
Line 2: Line 2:
  
 
= Lecture 14 Blog, [[ECE438]] Fall 2011, [[User:Mboutin|Prof. Boutin]] =
 
= Lecture 14 Blog, [[ECE438]] Fall 2011, [[User:Mboutin|Prof. Boutin]] =
Wednesday September 21, 2011 (Week 5) - See [[Lecture Schedule ECE438Fall11 Boutin|Course Outline]].  
+
Friday September 23, 2011 (Week 5) - See [[Lecture Schedule ECE438Fall11 Boutin|Course Outline]].  
  
 
----
 
----
 
+
Having obtained the relationship between the DT Fourier transform of  <math>x_1[n]</math> and that of an upsampling of x[n] by a factor D in the previous lecture, we observed that, under certain circumstances, a low-pass filter could be applied to this upsampling so to obtain the signal  
In Lecture 14, we continued discussing the sampling
+
 
+
<math>x_1[n]=x(T_1 n)</math>
+
 
+
of a continuous-time signal x(t). We obtained and discussed the relationship between the DT Fourier transform of  <math>x_1[n]</math> and that of a downsampling <math>y[n]=x_1[Dn]</math>, for some integer D>1.  We then obtained the relationship between the DT Fourier transform of  <math>x_1[n]</math> and that of an upsampling of x[n] by a factor D. In the next lecture, we will use this relationship to figure out how to transform this signal into the (higher resolution) signal  
+
  
 
<math>x_2[n]=x\left( n \frac{T_1}{D} \right)</math>.  
 
<math>x_2[n]=x\left( n \frac{T_1}{D} \right)</math>.  
----
 
Side notes:
 
*I think this may be a good time to pass some advice to current/future ECE301 students on [[Peer_Legacy_ECE301|the peer legacy page]]. 
 
*Here is a [[Student_summary_sampling_part1_ECE438F09|Rhea page on sampling contributed by a student]].
 
*[[Hw3_ECE438F11|HW3]] is now posted. It is due next Wednesday.
 
  
 +
We then began discussing the [[Discrete_Fourier_Transform|Discrete Fourier Transform]] (DFT).
  
 +
==Relevant Rhea pages==
 +
*[[Student_summary_Discrete_Fourier_transform_ECE438F09|A page about the DFT written by a student]]
 +
*[[Recommended exercise Fourier series computation DT|Recommended exercises of Fourier series computations for DT signals]] (to brush up on Fourier series))
 +
==Action items==
 +
*Keep working on the [[Hw3_ECE438F11|third homework]]
 +
*Solve the following practice problems and share your answer for feedback
 +
**[[Compute DFT practice no1 ECE438F11|Compute this DFT]]
 +
**[[Compute DFT practice no2 ECE438F11|Compute this other DFT]]
 
----
 
----
 
<br> Previous: [[Lecture13ECE438F11|Lecture 13]] Next: [[Lecture15ECE438F11|Lecture 15]]  
 
<br> Previous: [[Lecture13ECE438F11|Lecture 13]] Next: [[Lecture15ECE438F11|Lecture 15]]  
Line 25: Line 24:
 
[[2011_Fall_ECE_438_Boutin|Back to ECE438 Fall 2011]]
 
[[2011_Fall_ECE_438_Boutin|Back to ECE438 Fall 2011]]
  
[[Category:2011_Fall_ECE_438_Boutin]] [[Category:Blog]]
+
[[[Category:ECE438Fall2011Boutin]]  
 +
[[Category:ECE438]]
 +
[[Category:signal processing]]
 +
[[Category:ECE]]
 +
[[Category:Blog]]
 +
[[Category:discrete Fourier transform]]

Latest revision as of 06:24, 11 September 2013


Lecture 14 Blog, ECE438 Fall 2011, Prof. Boutin

Friday September 23, 2011 (Week 5) - See Course Outline.


Having obtained the relationship between the DT Fourier transform of $ x_1[n] $ and that of an upsampling of x[n] by a factor D in the previous lecture, we observed that, under certain circumstances, a low-pass filter could be applied to this upsampling so to obtain the signal

$ x_2[n]=x\left( n \frac{T_1}{D} \right) $.

We then began discussing the Discrete Fourier Transform (DFT).

Relevant Rhea pages

Action items



Previous: Lecture 13 Next: Lecture 15


Back to ECE438 Fall 2011

[[[Category:ECE438Fall2011Boutin]]

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood