(8 intermediate revisions by 3 users not shown)
Line 1: Line 1:
−
*[[CourseNotes1_(BoutinSpring2009)|Course Notes Lecture 1 Jan. 14th]]
+
[[Category:ECE]]
−
*[[CourseNotes2_(BoutinSpring2009)|Course Notes Lecture 2 Jan. 16th]]
+
[[Category:ECE438]]
−
*[[CourseNotes3_(BoutinSpring2009)|Course Notes Lecture 3 Jan. 18th]]
+
[[Category:signal processing]]
−
*[[CourseNotes4_(BoutinSpring2009)|Course Notes Lecture 4]]
+
[[Category:ECE438Spring2009mboutin]]
−
[[Category:ECE438Spring2009mboutin]][[Category:ECE438Spring2009mboutin:CourseNotes:Lecture1]]
+
[[Category:lecture notes]]
  
−
== ECE438 Course Notes January 14, 2009 ==
+
=Lecture Notes for [[ECE438]] Spring 2009, [[user:mboutin|Prof. Boutin]]=
−
 
+
*[[CourseNotes1_(BoutinSpring2009)|Course Notes Lecture 1 Jan. 14, 2009]]
−
1)Definitions
+
*[[CourseNotes2_(BoutinSpring2009)|Course Notes Lecture 2 Jan. 16, 2009]]
−
 
+
*[[CourseNotes3_(BoutinSpring2009)|Course Notes Lecture 3 Jan. 21, 2009]]
−
ECE438 is about digital signals and systems
+
*[[CourseNotes4_(BoutinSpring2009)|Course Notes Lecture 4 Jan. 23, 2009]]
−
 
+
*[[CourseNotes6_(BoutinSpring2009)|Course Notes Lecture 6 Jan. 28, 2009]]
−
2) Digital Signal = a signal that can be represented by a sequence of 0's and 1's.
+
*[[CourseNotes16_(BoutinSpring2009)|Course Notes Lecture 16 Feb. 23, 2009]]
−
so the signal must be DT X(t) = t, i.e. need x(n), n belongs to Z
+
*[[CourseNotes20_(BoutinSpring2009)|Course Notes Lecture 20 Mar. 11, 2009]]
−
 
+
*[[CourseNotes30_(BoutinSpring2009)|Course Notes Lecture 30 Apr. 17, 2009]]
−
Signal values must be discrete
+
----
−
 
+
[[ECE438_(BoutinFall2009)|Back to ECE438, Spring 2009]]
−
-<math>x(n) \in {0,1}</math> <-- binary valued signal
+
−
<br/><math>x(n) \in {0,1,2,...,255}</math> <-- gray scale valued signal
+
−
 
+
−
 
+
−
Another example of digital signal
+
−
 
+
−
-the pixels in a bitmap image (grayscale) can have a value of 0,1,2,...,255 for each individual pixel.
+
−
--If you concatenate all the rows of the image you can convert it to a 1 dimensional signal.
+
−
i.e. <math>x = (row1,row2,row3)</math>
+
−
 
+
−
2D Digital signal = signal that can be represented by an array of 0's and 1's
+
−
 
+
−
<u>example</u>: 128x128 gray scale image<br/>
+
−
<math>p_{ij} \in {0,...,255}</math>
+
−
 
+
−
matrix <math>A_{ij} = p_{ij}</math> of size 128x128 <br/>
+
−
 
+
−
[[Image:Vip_logo.jpg| 70px| left]]
+
−
Digital signals play an important roll in forensics applications such as: watermarking, image identification, and forgery detection among many others. Go to [http://cobweb.ecn.purdue.edu/~prints/publications.shtml PSAPF] and [http://cobweb.ecn.purdue.edu/~vip/teams/sensor_forensics.html VIP's Sensor Forensics] to find out more information about these applications.
+
−
 
+
−
<strong>Digital Systems</strong> = system that can process a ditital signal.<br/>
+
−
E.g.
+
−
<ul>
+
−
<li>Software (MATLAB,C, ...) </li>
+
−
<li>Firmware</li>
+
−
<li>Digital Hardware</li>
+
−
</ul>
+
−
 
+
−
== Advantages of Digital Systems ==
+
−
<ul>
+
−
<li>precise,reproducable</li>
+
−
<li>easier to store data</li>
+
−
<li>easier to build:
+
−
  <ul>
+
−
    <li>just need to represent 2 states instead of a continuous range of values</li>
+
−
  </ul>
+
−
</li>
+
−
</ul>
+
−
 
+
−
<strong>Software based digital systems</strong>
+
−
<ul>
+
−
<li>easier to build</li>
+
−
<li>cheap to build</li>
+
−
<li>adaptable</li>
+
−
<li>easy to fix/upgrade</li>
+
−
</ul>
+
−
 
+
−
<strong>Hardware-based digital systems</strong>
+
−
<ul>
+
−
<li>fast.</li>
+
−
 
+
−
</ul>
+
−
<table border="1px">
+
−
<tr>
+
−
<td  width="50%" align="center" valign="top">
+
−
<strong>Continuous time world</strong>
+
−
<ul>
+
−
<li>most natural signals live here</li>
+
−
<li>things are easy to write, understand, conceptualize</li>
+
−
 
+
−
</ul>
+
−
</td>
+
−
<td width="50%" align="center" valign="top">
+
−
<strong>Digital World</strong>
+
−
<ul>
+
−
<li>digital media signals live here along with computers, MATLAB, digital circuits</li>
+
−
</ul>
+
−
</td>
+
−
</tr>
+
−
</table>
+
−
<p>These world are brought together using sampling & quantization, as well as reconstruction</p>
+
−
 
+
−
== Signal Characteristics ==
+
−
<ul>
+
−
  <li>Deterministic vs. random
+
−
    <ul>
+
−
      <li>x(t) well defined , s.a. <math>x(t) =  e^{j\pi t}</math></li>
+
−
      <li>x(n) well defined , s.a. <math>x(n) = j^{n}</math> <br/>ex: Lena's image</li>
+
−
    </ul>
+
−
  </li>
+
−
  <li>Random
+
−
    <ul>
+
−
      <li>x(t) drawn according to some distribution</li>
+
−
      <li>example: x(t) white noise<br/>x = rand(10) (almost) random</li>
+
−
    </ul>
+
−
  </li>
+
−
</ul>
+
−
 
+
−
<ul>
+
−
  <li>Periodic vs. non-periodic
+
−
  <ul><li> if <math>\exists</math> positive T such that x(t+T) = x(t),<math>\forall t</math> then we say that x(t) is periodic with period T</li></ul>
+
−
  </li>
+
−
</ul>
+
−
 
+
−
== ECE438 Course Notes January 16, 2009 ==
+
−
 
+
−
<p><strong>Todays Goals</strong>
+
−
  <ul>
+
−
    <li>Signal Characteristics</li>
+
−
    <li>Signal Transformations</li>
+
−
    <li>Special Signals</li>
+
−
    <li>Singularity Functions</li>
+
−
  </ul>
+
−
</p>
+
−
 
+
−
<p><strong>right sided signal: </strong><br/>
+
−
<math>\exists t_{min} (n_{min})</math> such that <math>x(t) = 0</math> when <math>t < t_{min}</math>
+
−
</p>
+
−
 
+
−
<p><strong>left sided signal: </strong><br/>
+
−
<math>\exists t_{max} (n_{max})</math> such that <math>x(t) = 0</math> when <math>t > t_{max}</math><br/>
+
−
if <math>t_{max} \leq 0</math> we say the signal is <u>anticausal</u>
+
−
</p>
+
−
 
+
−
<p><strong>two sided (mixed causal):</strong><br/>
+
−
neither left sided nor right sided
+
−
</p>
+
−
 
+
−
<p><strong>Finite Duration Signal: </strong><br/>
+
−
both right and left sided, <math>\exists t_{min},t_{max}</math> such that <math>x(t) = 0</math> for <math>t > t_{max}</math> and <math>t < t_{min}</math>
+
−
</p>
+
−
 
+
−
<h3>Signal Metrics</h3>
+
−
<br/>
+
−
<ul style="list-style:none;">
+
−
  <li><strong>Signal Energy</strong>
+
−
    <ul style="list-style:none;">
+
−
      <li>
+
−
        <p><math>E_x = \int_{-\infty}^{\infty} |x(t)|^2\,dt</math> for ct (continuous time)</p>
+
−
        <p><math>E_x = \sum_{n=-\infty}^{\infty} |x(n)|^2</math> for dt (discrete time)</p>
+
−
      </li>
+
−
    </ul>
+
−
  </li>
+
−
  <li><strong>Signal Power</strong>
+
−
    <ul style="list-style:none;">
+
−
      <li>
+
−
        <p><math>P_x = \lim_{T \Rightarrow \infty}\frac{1}{2T}\int_{-T}^{T} |x(t)|^2\,dt</math> for ct (continuous time)</p>
+
−
        <p><math>P_x = \lim_{N \Rightarrow \infty}\sum_{n=-N}^{N} |x(n)|^2</math> for dt (discrete time)</p>
+
−
        <p>note: for periodic signals <br/>
+
−
        <math>P_x = \frac{1}{N}\sum_{n=0}^{N-1}|x(n)|^2</math>
+
−
        </p>
+
−
      </li>
+
−
    </ul>
+
−
  </li>
+
−
  <li><strong>Signal RMS (root-mean-square)</strong>
+
−
    <ul style="list-style:none;">
+
−
      <li>
+
−
      <math>X_{rms} = \sqrt{P_x}</math>
+
−
      </li>
+
−
    </ul>
+
−
  </li>
+
−
  <li><strong>Signal Magnitude</strong>
+
−
    <ul style="list-style:none;">
+
−
      <li>
+
−
        <p><math>m_x = max|x(t)|</math>, for CT</p>
+
−
        <p><math>m_x = max|x(n)|</math>, for DT</p>
+
−
        <p> if <math>m_x < \infty</math>, we say signal is bounded</p>
+
−
      </li>
+
−
    </ul>
+
−
  </li>
+
−
  <li><strong>Scaling (<math>y(t) = x(\frac{t}{a})</math>)</strong>
+
−
    <ul style="list-style:none;">
+
−
      <li>
+
−
        <p>note: y(0) = x(0), fixed point at t=0<br/>
+
−
        if a > 1, graph will narrow<br/>
+
−
        if a < 1, graph will expand<br/><br/>
+
−
        <font style="color:red;">if a>1 will not work for digital signals</font>
+
−
        </p><br/>
+
−
        <p><strong>Down Sampler:</strong><br/>
+
−
          <math>y(n) = x(Dn)</math>, D = integer > 1<br/>
+
−
          <math>x(n) \Rightarrow D\Downarrow \Rightarrow y(n)</math>
+
−
        </p>
+
−
        <p><strong>Up Sampler:</strong> <math>x(n) \Rightarrow D\Uparrow \Rightarrow y(n)</math><br/>
+
−
          <math>y(n) = x(\frac{n}{D})</math>, if n/D is an integer
+
−
        </p>
+
−
        <p><strong>Scaling and Shifting</strong> <math>y(t) = x(\frac{t}{a}-t_0)</math><br/>
+
−
          note: <math>y(0) = x(-t_0)</math>
+
−
        </p>
+
−
      </li>
+
−
    </ul>
+
−
  </li>
+
−
</ul>
+
−
 
+
−
== ECE438 Course Notes January 21, 2009 ==
+
−
 
+
−
<p><h3><u>Delta Functions</u></h3><br/>
+
−
<strong>Continuous-time:</strong> (a.k.a. Dirac delta function)<br/>
+
−
<math>\delta(t) = \lim_{\triangle \Rightarrow 0} \frac{1}{\triangle}rect(\frac{t}{\triangle})</math><br/>
+
−
<u>Properties</u><br/>
+
−
<ul>
+
−
  <li><math>\int_{-\infty}^{\infty} \delta(t)\,dt = 1</math>(unit area)</li>
+
−
  <li><math>\int_{-\infty}^{\infty} x(t) \delta(t-t_0)\,dt = x(t_0)</math>(sifting property)</li>
+
−
</ul>
+
−
</p>
+
−
<p><strong>Discrete-time:</strong> (a.k.a. Kronecher delta fn.)<br/>
+
−
<math>\delta[n] = 1 | n=0, 0 | 0 > n < 0</math>
+
−
<ul>
+
−
  <li>Sifting Property: <math>\sum_{n=-\infty}^{\infty} x[n] \delta[n-n_0] = x[n_0]</math></li>
+
−
</ul>
+
−
</p>
+
−
 
+
−
<h3>Comb &amp; Rep operators (for CT signals)</h3>
+
−
<p>Comb operator multiplies a signal by an "impulse train".
+
−
<ul>
+
−
<li><math>\sum_{k=-\infty}^{\infty} \delta(t-kT)</math></li>
+
−
<li><math>Comb_T{{x(t)}} = x(t)\sum_{k=-\infty}^{\infty} \delta(t-kT) = \sum_{k=-\infty}^{\infty} x(kT)\delta(t-kT)</math></li>
+
−
</ul>
+
−
</p>
+
−
 
+
−
<p><strong>Rep operator</strong> simply replicates a signal every T units:<br/>
+
−
<math>rep_T{{x(t)}} = \sum_{k=-\infty}^{\infty} x(t-kT)</math>
+
−
</p>
+
−
 
+
−
<h3>Systems</h3>
+
−
<p>A system maps an input signal x(t) to a unique output signal, y(t).
+
−
<math>x(t) \Rightarrow \mbox {System} \Rightarrow y(t)</math><br/>
+
−
<math>y(t) = S[x(t)]</math>
+
−
</p>
+
−
<p><Strong>Examples:</strong><br/>
+
−
<math>y(n) = \frac{1}{3}[x(n) + x(n-1) + x(n-2)]</math> (moving averaging function, seen in Lab2)
+
−
</p>
+
−
 
+
−
<p><u>System Properties:</u><br/>
+
−
<ul>
+
−
  <li>Linearity
+
−
    <ul>
+
−
      <li>Definition: A system S is linear if for any two input signals <math>x_1(t)</math> and <math>x_2(t)</math>, and any (complex) constant, a, it satisfies the following two properties:</li?
+
−
      <li>Superposition: <math>S[x_1(t) + x_2(t)] = S[x_1(t)] + S[x_2(t)]</math></li>
+
−
      <li>Homogeneity: <math>S[ax_1(t)] = aS[x_1(t)]</math></li>
+
−
    </ul>
+
−
  </li>
+
−
  <li>Time-Invariance
+
−
    <ul>
+
−
      <li>Definition: A system S is time-invariant(TI) if delaying the input signal results only in an identical delayin the output signal.</li>
+
−
      <li>If <math>y_1(t) = S[x_1(t)]</math> and <math> y_2(t) = S[x_1(t-t_0)]</math> than <math>y_2(t) = y_1(t-t_0)</math></li>
+
−
    </ul>
+
−
  </li>
+
−
</ul>
+
−
</p>
+
−
 
+
−
== ECE438 Course Notes January 23, 2009 ==
+
−
 
+
−
<strong>Side Note: Issues with Rhea</strong>
+
−
<p>
+
−
Issue #1: Scaling horizontally of entire page causes top navigation to shrink too far and become ridiculous...<br/>
+
−
Solution: CSS Styling min-width: 800px; or something around that on the div containing the black navigation header will resolve this issue;
+
−
<br/><br/>
+
−
Issue #2: Drop Down menus do not work on Internet Explorer 6<br/>
+
−
Solution: Javascript plugins can be used to create drop down menus on an If IE6 check<br/>
+
−
<br/>
+
−
Issue #3: Creating Completely new pages isnt clear on how to do<br/>
+
−
Solution: Be more clear and have more informative navigation<br/>
+
−
The features of this site are completely within the bounds of IE6 with a little work...Far more difficult has been accomplished in ie6
+
−
</p>
+
−
* I think these comments should be put [[Issues with Rhea|here]] instead. I took the freedom to move them. Whoever wrote these comments, please feel free to go put your signature next to each issue and/or solution on the page.--[[User:Alibaba|Alibaba]] 16:21, 26 January 2009 (UTC)
+
−
 
+
−
<p><strong><u>Professor Mimi's Definitions of System Properties</u></strong><br/>
+
−
<font style="color:blue">Use of diagrams makes this difficult to add in, please see previous days lecture notes for the properties of Linearity and Time-Invariance.</font>
+
−
 
+
−
<ul>
+
−
  <li>Causality
+
−
    <ul>
+
−
      <li>if for any  <math>t_0\,,x_1(t) = x_2(t), \forall t \leq t_0</math> <br/><math>\Rightarrow y_1(t)=y_2(t), \forall t \leq t_0</math><br/>output at t0 depends on input at <math> t \leq t_0</math> only.
+
−
      </li>
+
−
    </ul>
+
−
  </li>
+
−
  <li>BIBO Stable (Bounded-Input-Bouned-Output Stability)
+
−
    <ul>
+
−
      <li>if any bounded input yields a bounded output.<br/>
+
−
          i.e. if x(t) / x(n) st <math>M_x < \infty</math><br/>
+
−
        <math>\Rightarrow y(t)/ y(n)</math>s.t. <math> M_y < \infty</math>
+
−
      </li>
+
−
      <li>To show stability mathematically use triangle inequality. We assume x(n) is bounded and try to show y(n) is then also bounded</li>
+
−
    </ul>
+
−
  </li>
+
−
</ul>
+
−
</p>
+

Latest revision as of 05:37, 16 September 2013


Lecture Notes for ECE438 Spring 2009, Prof. Boutin

Back to ECE438, Spring 2009

Retrieved from "https://www.projectrhea.org/rhea/index.php?title=ECE_438_Spring_2009_mboutin_Course_Notes&oldid=58285"
Shortcuts
Help Main Wiki Page Random Page Special Pages Log in
Search

Alumni Liaison

Basic linear algebra uncovers and clarifies very important geometry and algebra.

Dr. Paul Garrett