1 / 10

Erik Jonsson School of Engineering and Computer Science

Explore logic gates, Boolean algebra, and simplifying logic circuits in this course. Learn about NAND, NOR, XOR gates and more. Download PCSPIM for assignments.

shonnag
Download Presentation

Erik Jonsson School of Engineering and Computer Science

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

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

  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) 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 ProductsMinterm Boolean Expression = Truth Table = Circuit A’B’C’+A’B’C+A’BC’+A’BC+AB’C’+AB’C+ABC’+ABC=1

  9. Logic Axioms

More Related