Basic Digital Design Discussion D5.4 Section 13.6.

Slides:



Advertisements
Similar presentations
Combinational Logic Circuits Chapter 2 Mano and Kime.
Advertisements

Introduction to Computer Engineering by Richard E. Haskell Basic Digital Design Module M1.2 Section 3.2.
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.
EE365 Boolean algebra Combinational-circuit analysis.
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.
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.
EE365 Adv. Digital Circuit Design Clarkson University Lecture #2 Boolean Laws and Methods.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
Introduction to Computer Engineering by Richard E. Haskell Basic Logic Gates Module M1.1 Section 3.1.
Boolean Algebra and Logic Gates1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
ENEE244-02xx Digital Logic Design Lecture 10. Announcements HW4 assigned, due 10/9.
Logic Functions and their Representation. Slide 2 Combinational Networks x1x1 x2x2 xnxn f.
Combinational Logic Circuits Chapter 2 Mano and Kime.
AOI Logic Implementation © 2014 Project Lead The Way, Inc.Digital Electronics.
AOI Logic Implementation
Constructing A Truth Table XYZF1F InputsOutput Input Combinations 3 – Inputs 8 – Combinations (8 = 2 3 ) Note the binary counting order.
Boolean Algebra Computer Organization 1 © McQuain Boolean Algebra A Boolean algebra is a set B of values together with: -two binary operations,
1 Why study Boolean Algebra? 4 It is highly desirable to find the simplest circuit implementation (logic) with the smallest number of gates or wires. We.
Lecture 4 Logic gates and truth tables Implementing logic functions
Digital Logic ENEL 111. Digital systems A digital system is a system whose inputs and outputs fall within a discrete, finite set of values Two main types.
9/15/09 - L6 Standard FormsCopyright Joanne DeGroat, ECE, OSU1 Standard Forms.
Switching functions The postulates and sets of Boolean logic are presented in generic terms without the elements of K being specified In EE we need to.
ECE 331 – Digital System Design
 Seattle Pacific University EE Logic System DesignSOP-POS-1 The Connection: Truth Tables to Functions abcF abcF
Sum of Products Section 2.7.
Discrete Mathematics and Its Applications.  The English mathematician George Boole ( ) sought to give symbolic form to Aristotle's system of.
AOI Logic Implementation
Basic logic gates  AND gate:The truth table is given by A.BBA
Chapter 3 Gate-Level Minimization
Boolean Logic and Circuits ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.
ECE 2110: Introduction to Digital Systems PoS minimization Don’t care conditions.
1 ENGR 254 Lecture DeMorgan Symbol Equivalence.
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.
Karnaugh map minimization Basic Terms (1) minterm maxterm - a single 1 - a single 0 1. implicant
Venn Diagram – the visual aid in verifying theorems and properties 1 E.
ECE 3110: Introduction to Digital Systems Combinational-Circuit Synthesis.
ECE 3110: Introduction to Digital Systems
Lecture 09 NAND and XOR Implementations. Overview °Developing NAND circuits °Two-level implementations Convert from AND/OR to NAND (again!) °Multi-level.
Computer logic Data and programs in digital computers are represented and processed by electronic circuit networks called digital logic circuits or logic.
CHAPTER 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs
1 Lect # 2 Boolean Algebra and Logic Gates Boolean algebra defines rules for manipulating symbolic binary logic expressions. –a symbolic binary logic expression.
1 Digital Logic Design Week 5&6 cont’d Revision for Quiz 2/Exam.
ECE 3110: Introduction to Digital Systems Chapter #4 Review.
CMPUT Computer Organization and Architecture II1 CMPUT329 - Fall 2002 Topic2: DeMorgan Laws José Nelson Amaral.
ECE2030 Introduction to Computer Engineering Lecture 6: Canonical (Standard) Forms Prof. Hsien-Hsin Sean Lee School of Electrical and Computer Engineering.
1/16/ CSEE, UQ Lecture 3 Hardware Description Methods, Review of Switching Algebra.
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.
C.S. Choy21 BOOLEAN ALGEGRA The Mathematics of logic Boolean variables have only two possible values (binary) Operators:. Product+ SumComplement A.B A+B.
Appendix B: Digital Logic
CEC 220 Digital Circuit Design SOP and POS forms Friday, January 23 CEC 220 Digital Circuit Design Slide 1 of 17.
Figure 2.1. A binary switch. x1=x0= (a) Two states of a switch S x (b) Symbol for a switch.
ELECTRICAL ENGINEERING: PRINCIPLES AND APPLICATIONS, Third Edition, by Allan R. Hambley, ©2005 Pearson Education, Inc. Chapter 7 Logic Circuits.
Figure 5–5 Exclusive-OR logic diagram and symbols. Open file F05-05 to verify the operation. Thomas L. Floyd Digital Fundamentals, 9e Copyright ©2006 by.
CEC 220 Digital Circuit Design SOP and POS forms Friday, Sept 11 CEC 220 Digital Circuit Design Slide 1 of 17.
CHAPTER 13 Digital Logic Circuits. Figure Voltage analog of internal combustion engine in-cylinder pressure Figure 13.1.
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.
Fundamentals of Logic Design, 7 th editionRoth/Kinney © 2014 Cengage Learning Engineering. All Rights Reserved. 1 Boolean Algebra (continued) UNIT 3.
Homework Reading Machine Projects Labs
Table 2.1 Postulates and Theorems of Boolean Algebra
Homework Reading Machine Projects Labs
Instructor: Alexander Stoytchev
Instructor: Alexander Stoytchev
AOI Logic Implementation
Divisibility Rules.
Table 2.1 Postulates and Theorems of Boolean Algebra
Applications of Boolean Algebra Minterm and Maxterm Expansions
Presentation transcript:

Basic Digital Design Discussion D5.4 Section 13.6

Basic Digital Design Sum-of-Products Design Product-of-Sums Design

Sum of Products Design Exclusive-OR Gate XOR X Y Z Z = X ^ Y X Y Z

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

Sum of Products Design X Y Z Design an XOR gate m1 = ~X & Y m2 = X & ~Y Z = m1 | m2 = (~X & Y) | (X & ~Y)

Sum of Products: Exclusive-OR ~X & Y X & ~Y Z = (~X & Y) | (X & ~Y)

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

Problem

F = ~X & ~Y | X & Y

Basic Digital Design Sum-of-Products Design Product-of-Sums Design

Product of Sums Design Maxterms: A maxterm is NOT a minterm maxterm M0 = NOT minterm m0 M0 = ~m0 = ~(~X & ~Y) = ~~(~~X | ~~Y) = X | Y

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

Product of Sums Design X Y Z Design an XOR gate Z is NOT minterm m0 AND it is NOT minterm m3

Product of Sums Design X Y Z Design an XOR gate M0 = X | Y M3 = ~X | ~Y Z = M0 & M3 = (X | Y) & (~X | ~Y)

Product of Sums: Exclusive-OR