100 likes | 182 Views
Dive into the fundamentals of digital systems including logic gates, Boolean algebra, and simplifying circuits. Includes practical exercises and assignments using PCSPIM.
E N D
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
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
Thursday (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 ProductsMinterm Boolean Expression = Truth Table = Circuit A’B’C’+A’B’C+A’BC’+A’BC+AB’C’+AB’C+ABC’+ABC=1