Lecture 3-5 - Lectures 3-5 8/30/10 9/3/10 Announcements Hwk...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
Lectures 3-5 – 8/30/10 – 9/3/10 Announcements Hwk 2 posted Tuesday 8/31 Hwk 1 due Friday 9/3 in your discussion section No class Monday 9/6 (my anniversary) Some basic concepts in computer systems Boolean Logic The mighty transistor Circuits CS310 Fall 2010 - Boral a a 0 1 1 0 Boolean Algebra Combinations: NOT (A OR B) aka A NOR B Identities: X+0 = X, X+1 = 1, X*0 = 0, X*1 = X, X+X = 1, X*X = 0, X+X = X, X*X = X X = X A + B = B + A A + (B + C) = (A + B) + C A * (B + C) = (A * B) + (A * C) a b a+b 0 0 0 0 1 1 1 0 1 1 1 1 a b a*b 0 0 0 0 1 0 1 0 0 1 1 1 NOT OR AND CS310 Fall 2010 - Boral
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
DeMorgan’s Laws B A A+B = A B A+B 0 0 1 1 1 0 0 0 1 1 0 0 1 1 1 0 0 1 0 1 1 1 1 0 0 0 1 1 B A B A B A A*B = Why do we care? CS310 Fall 2010 - Boral Controlled Switches 1 Assert high controlled switch y = x * A (path iff A = 1) (path only when a = b = 1) (path only when a = 1 or b = 1) CS310 Fall 2010 - Boral
Background image of page 2
Controlled Switches 2 Assert low controlled switch y = x * A (path iff A = 0) (path only when a = b = 0) CS310 Fall 2010 - Boral Controlled Switches 3 Output is defined for some, but not all, cases for an individual assert-high or an individual assert-low controlled switch Combine them (using the two-stone theory) to create an implementation of the NOT Boolean function Output is defined for all cases! CS310 Fall 2010 - Boral
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Enter The Mighty Transistor 1 An electronic switch Behaves like a controlled switch n-Type is the analog of an assert high controlled switch p-Type is the analog of an assert low controlled switch Three terminals Gate (G) controls flow of electrons between Source (S) and Drain (D) Powered by voltage Vdd (positive) is the analog of a “1” in a controlled switch
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/30/2010 for the course CS 310 taught by Professor Fussell during the Spring '08 term at University of Texas at Austin.

Page1 / 15

Lecture 3-5 - Lectures 3-5 8/30/10 9/3/10 Announcements Hwk...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online