# Erik Jonsson School of Engineering and Computer Science FEARLESS Engineeringwww.utdallas.edu/~pervin EE/CE 2310 – HON/002 Introduction to Digital Systems.

## Presentation on theme: "Erik Jonsson School of Engineering and Computer Science FEARLESS Engineeringwww.utdallas.edu/~pervin EE/CE 2310 – HON/002 Introduction to Digital Systems."— Presentation transcript:

Erik Jonsson School of Engineering and Computer Science FEARLESS Engineeringwww.utdallas.edu/~pervin EE/CE 2310 – HON/002 Introduction to Digital Systems http://www.utdallas.edu/~pervin T5 Tuesday: Read Chapter T5 Thursday 2-02-12

Overview (T4) Other Logic Gates –NAND (Universal Gate) –NOR –XOR –XNOR (T5) Simplifying Logic Circuits –Sum of Products –Karnaugh Maps

Boolean Algebra and Truth Tables or not xor

Additional Boolean Operators nand nor xnor

All Binary Operators

Universal NAND Gate

Thursday T5 (T5) Simplifying Logic Circuits Download and install PCSPIM from the web (Dr. James R. Larus) Look at the assignments on the web page

Sum of Products Minterm Boolean Expression = Truth Table = Circuit A’B’C’+A’B’C+A’BC’+A’BC+AB’C’+AB’C+ABC’+ABC=1 000 001 010 011 100 101 110 111

Logic Axioms

Download ppt "Erik Jonsson School of Engineering and Computer Science FEARLESS Engineeringwww.utdallas.edu/~pervin EE/CE 2310 – HON/002 Introduction to Digital Systems."

Similar presentations