{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

lec16

# lec16 - CSE20 Lecture 16 Boolean Algebra Applications...

This preview shows pages 1–8. Sign up to view the full content.

1 CSE20 Lecture 16 Boolean Algebra: Applications Professor CK Cheng CSE Dept. UC San Diego

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

View Full Document
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

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

View Full Document
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. Assignment: A, B are in {0, 1} (Down, Up) Y is in {0,1} (Off, On)
5 Light Switches Truth Table Karnaugh Map Id A B Y 0 0 0 0 1 0 1 1 2 1 0 1 3 1 1 0 Y A=0 A=1 B=0 0 1 B=1 1 0

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

View Full Document
6 Light Switches Minimal Expression in sum of products format. Y(A,B)=A’B+AB’
7 Bit Counter Input: Three binary bits (A, B, C) Output: (S 1 ,S 0 ) that counts the number of 1’s in (A, B, C).

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 20

lec16 - CSE20 Lecture 16 Boolean Algebra Applications...

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

View Full Document
Ask a homework question - tutors are online