This preview shows pages 1–8. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 1 CSE20 Lecture 16 Boolean Algebra: Applications Professor CK Cheng CSE Dept. UC San Diego 1 2 Outlines Introduction Light Switches Bit Counter Multiplication Multiplexer Priority Encoder Summary 3 Introduction Language Description Truth Table Karnaugh Map Minimal Expression Digital Logic Networks 4 Light Switches Given two switches A, B with two states (Up, Down), the switches control one light emitter Y. Initially A=B=Down, and Y=Off. The light Y is turned between Off and On when one of the switch changes its state. Describe Y as a function of A and B. 4 Assignment: A, B are in {0, 1} (Down, Up) Y is in {0,1} (Off, On) 5 Light Switches Truth Table Karnaugh Map 5 Id A B Y 1 1 1 2 1 1 3 1 1 Y A=0 A=1 B=0 1 B=1 1 6 Light Switches Minimal Expression in sum of products format. Y(A,B)=AB+AB 6 7 Bit Counter Input: Three binary bits (A, B, C) Output: (S 1 ,S ) that counts the number of 1s in (A, B, C)....
View
Full
Document
This note was uploaded on 12/11/2011 for the course CSE 20 taught by Professor Foster during the Fall '08 term at UCSD.
 Fall '08
 Foster

Click to edit the document details