Introduction to Computer Engineering by Richard E. Haskell Basic Digital Design Module M1.2 Section 3.2.

Slides:



Advertisements
Similar presentations
Basic Logic Gates Discussion D5.1 Section Sections 13-3, 13-4.
Advertisements

Introduction to Computer Engineering by Richard E. Haskell BCD Arithmetic Module M16.5 Section 10.4.
Combinational Logic Circuits Chapter 2 Mano and Kime.
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.
CS 151 Digital Systems Design Lecture 11 NAND and XOR Implementations.
1 Homework Reading –Tokheim, Section 5-1, 5-2, 5-3, 5-7, 5-8 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.
Basic Digital Design Discussion D5.4 Section 13.6.
Basic Digital Design Discussion D2.3. Basic Digital Design Sum of Products Design –Minterms Product of Sums Design –Maxterms.
ENGIN112 L11: NAND and XOR Implementation September 26, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 11 NAND and XOR Implementations.
Introduction to Computer Engineering by Richard E. Haskell Number Systems Module M3.1 Sections
Introduction to Computer Engineering by Richard E. Haskell 8086 Tutor Monitor Module M14.3 Section 9.3 Appendix B.
Basic Digital Design Discussion D5.4 Appendix F. Basic Digital Design Sum-of-Products Design Product-of-Sums Design.
Basic Digital Design Discussion D2.3. Basic Digital Design Sum of Products Design –Minterms Product of Sums Design –Maxterms.
1 Homework Reading –Tokheim, Chapter 3, 4, and –Logg-o on Analytical Engine Website Machine Projects –Continue on mp3 Labs –Continue in labs.
Lecture 1: Introduction to Digital Logic Design CK Cheng Tuesday 4/1/02.
Introduction to Computer Engineering by Richard E. Haskell Logical Instructions Module M16.6 Section 10.5.
Introduction to Computer Engineering by Richard E. Haskell 8086 Memory Module M14.1 Sections 9.3.
Introduction to Computer Engineering by Richard E. Haskell Basic Logic Gates Module M1.1 Section 3.1.
Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2 Dr. Costas Kyriacou and Dr. Konstantinos.
Boolean Algebra and Logic Gates1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Introduction to Computer Engineering by Richard E. Haskell Shift and Rotate Instructions Module M16.2 Section 10.3.
Combinational Logic Circuits Chapter 2 Mano and Kime.
AOI Logic Implementation © 2014 Project Lead The Way, Inc.Digital Electronics.
Erik Jonsson School of Engineering and Computer Science FEARLESS Engineeringwww.utdallas.edu/~pervin EE/CE 2310 – HON/002 Introduction to Digital Systems.
AOI Logic Implementation
XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.
What is an And Gate? It is a digital circuit that produce logical operations The logical operations are call Boolean logical Boolean operation consist.
Sum of Products Section 2.7.
CS 151: Introduction to Digital Design Chapter 2-9 Exclusive-OR Gates.
Discrete Mathematics and Its Applications.  The English mathematician George Boole ( ) sought to give symbolic form to Aristotle's system of.
AOI Logic Implementation
Boolean Logic and Circuits ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.
ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.
CE1110 :Digital Logic Design lecture 02 Digital Logic Gates Dr. Atef Ali Ibrahim 1.
Digital Electronics Digital Electronics G.S.UTHAYAKUMAR ST.JOSEPH’S COLLEGE OF ENGINEERING,CHENNAI-119.
Department of Computer Engineering. 2 Engr Ahmad Bilal M IN AND MAX Term Khabi Gharoor Nahi Kiya.
CHAPTER 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs
1 Digital Logic Design Week 5&6 cont’d Revision for Quiz 2/Exam.
1 Homework Reading –Tokheim, Section 5-1, 5-2, 5-3, 5-7, 5-8 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.
CEC 220 Digital Circuit Design SOP and POS forms Friday, January 23 CEC 220 Digital Circuit Design Slide 1 of 17.
How does a Computer Add ? Logic Gates within chips: AND Gate A B Output OR Gate A B Output A B A B
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR and parity check Circuits.
ELECTRICAL ENGINEERING: PRINCIPLES AND APPLICATIONS, Third Edition, by Allan R. Hambley, ©2005 Pearson Education, Inc. Chapter 7 Logic Circuits.
CEC 220 Digital Circuit Design SOP and POS forms Friday, Sept 11 CEC 220 Digital Circuit Design Slide 1 of 17.
Logic Gates Review. Logic Gates OR gate – 1 if either input is 1 – 0 if they both are 0.
Computer Architecture CST 250 Logic Gates & Truth Tables Prepared by:Omar Hirzallah.
Basic Gates and ICs 74LS00 Quad 2-Input NAND gate 74LS02 Quad 2-Input NOR gate 74LS04 Quad 2-Input NOT gate 74LS08 Quad 2-Input AND gate 74LS32 Quad 2-Input.
Homework Reading Machine Projects Labs
Table 2.1 Postulates and Theorems of Boolean Algebra
Prof. Hsien-Hsin Sean Lee
Combinational Logic Circuits
Homework Reading Machine Projects Labs
CS 105 Digital Logic Design
Basic Logical Operations (Fascinating)
Instructor: Alexander Stoytchev
Instructor: Alexander Stoytchev
ELL100: INTRODUCTION TO ELECTRICAL ENGG.
Boolean Algebra Logic Gates
CSC 220: Computer Organization Logic Gates and Functions
AOI Logic Implementation
Divisibility Rules.
Table 2.1 Postulates and Theorems of Boolean Algebra
Discussion D5.1 Section Sections 13-3, 13-4
Applications of Boolean Algebra Minterm and Maxterm Expansions
Digital Logic Chapter-2
Circuit to Truth Table to Logic Expression
Digital Logic Chapter-2
NAND and XOR Implementation
Karnaugh Map Method By: Asst Lec. Besma Nazar Nadhem
Presentation transcript:

Introduction to Computer Engineering by Richard E. Haskell Basic Digital Design Module M1.2 Section 3.2

Introduction to Computer Engineering by Richard E. Haskell Basic Digital Design Sum of Products Design –Minterms Product of Sums Design –Maxterms

Introduction to Computer Engineering by Richard E. Haskell Exclusive-OR Gate XOR X Y Z Z = X $ Y X Y Z

Introduction to Computer Engineering by Richard E. Haskell Sum of Products Design X Y minterms 0 0 m0 = !X & !Y 0 1 m1 = !X & Y 1 0 m2 = X & !Y 1 1 m3 = X & Y

Introduction to Computer Engineering by Richard E. Haskell Sum of Products Design X Y Z Design an XOR gate m1 = !X & Y m2 = X & !Y Z = m1 # m2 = (!X & Y) # (X & !Y)

Introduction to Computer Engineering by Richard E. Haskell Sum of Products: Exclusive-OR !X & Y X & !Y Z = (!X & Y) # (X & !Y)

Introduction to Computer Engineering by Richard E. Haskell Precedence of Logical Operators All ! operations are done first All & operations are done next All # operations are done last Z = (!X & Y) # (X & !Y) = !X & Y # X & !Y

Introduction to Computer Engineering by Richard E. Haskell Problem

Introduction to Computer Engineering by Richard E. Haskell Basic Digital Design Sum of Products Design –Minterms Product of Sums Design –Maxterms

Introduction to Computer Engineering by Richard E. Haskell Product of Sums Design Maxterms: A maxterm is NOT a minterm maxterm M0 = NOT minterm m0 M0 = !m0 = !(!X & !Y) = !!(!!X # !!Y) = X # Y

Introduction to Computer Engineering by Richard E. Haskell Product of Sums Design X Y minterms maxterms 0 0 m0 = !X & !Y M0 = !m0 = X # Y 0 1 m1 = !X & Y M1 = !m1 = X # !Y 1 0 m2 = X & !Y M2 = !m2 = !X # Y 1 1 m3 = X & Y M3 = !m3 = !X # !Y

Introduction to Computer Engineering by Richard E. Haskell Product of Sums Design X Y Z Design an XOR gate Z is NOT minterm m0 AND it is NOT minterm m3

Introduction to Computer Engineering by Richard E. Haskell Product of Sums Design X Y Z Design an XOR gate M0 = X # Y M3 = !X # !Y Z = M0 & M3 = (X # Y) & (!X # !Y)

Introduction to Computer Engineering by Richard E. Haskell Product of Sums: Exclusive-OR