Download presentation

Presentation is loading. Please wait.

Published byEugene Phillips Modified over 3 years ago

1
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

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

3
Boolean Algebra and Truth Tables or not xor

4
Additional Boolean Operators nand nor xnor

5
All Binary Operators

6
Universal NAND Gate

7
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

8
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

10
Logic Axioms

Similar presentations

© 2019 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google