Chapter 2 Combinational Systems

Slides:



Advertisements
Similar presentations
Chapter 2 Logic Circuits.
Advertisements

Prof. YingLi Tian Sept. 10, 2012 Department of Electrical Engineering The City College of New York The City University of New York (CUNY) Lecture 4: Implementation.
ECE 331 – Digital System Design
Chapter 2 – Combinational Logic Circuits Part 1 – Gate Circuits and Boolean Equations Logic and Computer Design Fundamentals.
CS 151 Digital Systems Design Lecture 6 More Boolean Algebra A B.
COMBINATIONAL LOGIC CIRCUITS C.L. x1 x2 xn Z Z = F (x1, x2, ……., Xn) F is a Binary Logic (BOOLEAN ) Function Knowing F Allows Straight Forward Direct Implementation.
CSCE 211: Digital Logic Design
CSCE 211: Digital Logic Design
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.
Chapter 2 Combinational Systems And / Or / Not. TRIAD PRINCIPLE: Combinational is about And / Or / Not combinations As well as equivalent functions. It.
CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.
1 COMBINATIONAL LOGIC One or more digital signal inputs One or more digital signal outputs Outputs are only functions of current input values (ideal) plus.
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
2 - 1 Chapter 2 Combinational Systems Chapter 2 Combinational Systems 2.1 The Design Process for Combinational Systems  Continuing Example(CE)
F = ∑m(1,4,5,6,7) F = A’B’C+ (AB’C’+AB’C) + (ABC’+ABC) Use X’ + X = 1.
Ahmad Almulhem, KFUPM 2009 COE 202: Digital Logic Design Combinational Logic Part 2 Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:
Chapter 2: Boolean Algebra and Logic Gates. F 1 = XY’ + X’Z XYZX’Y’XY’X’ZF1F
ECE 2110: Introduction to Digital Systems PoS minimization Don’t care conditions.
Physics 343 Advanced Electronics Engineering 343 Digital Systems Electronics Courses.
1 EG 32 Digital Electronics Thought for the day You learn from your mistakes..... So make as many as you can and you will eventually know everything.
Based on slides by:Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. ECE/CS 352: Digital System Fundamentals Lecture 6 – Canonical Forms.
Chap 2. Combinational Logic Circuits
ES 244: Digital Logic Design Chapter 2 Chapter 2: Combinational Systems Adapted from Alan Marcovitz’s Introduction to Logic and Computer Design Uchechukwu.
ece Parity Used to check for errors Can be either ODD or EVEN Left most bit used as the indicator For EVEN, insert a 0 or a 1 so as to make the.
Chapter 2: Basic Definitions BB inary Operators ●A●AND z = x y = x yz=1 if x=1 AND y=1 ●O●OR z = x + yz=1 if x=1 OR y=1 ●N●NOT z = x = x’ z=1 if x=0.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 4 Dr. Shi Dept. of Electrical and Computer Engineering.
Chapter 2 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Combinational Systems.
Review. Boolean Algebra.
ECE DIGITAL LOGIC LECTURE 8: BOOLEAN FUNCTIONS Assistant Prof. Fareena Saqib Florida Institute of Technology Spring 2016, 02/11/2016.
Standard & Canonical Forms COE 202 Digital Logic Design Dr. Aiman El-Maleh College of Computer Sciences and Engineering King Fahd University of Petroleum.
ECE 301 – Digital Electronics Minimizing Boolean Expressions using K-maps, The Minimal Cover, and Incompletely Specified Boolean Functions (Lecture #6)
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC. De Morgan’s Theorem De Morgan’s Theorem.
DE MORGAN’S THEOREM. De Morgan’s Theorem De Morgan’s Theorem.
©2010 Cengage Learning SLIDES FOR CHAPTER 4 APPLICATIONS OF BOOLEAN ALGEBRA MINTERM AND MAXTERM EXPANSIONS Click the mouse to move to the next page. Use.
UNIT 4 APPLICATIONS OF BOOLEAN ALGEBRA MINTERM AND MAXTERM EXPANSIONS Click the mouse to move to the next page. Use the ESC key to exit this chapter. This.
Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經 察政章(Chapter 58) 伏者潛藏也
Lecture 3: Incompletely Specified Functions and K Maps
De Morgan’s Theorem,.
Combinational Logic Design&Analysis.
Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and
Chapter 2: Boolean Algebra and Logic Functions
Introduction to Logic Design
ECE 2110: Introduction to Digital Systems
ECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #2 Instructor: Andrew B. Kahng (lecture)
CS 105 Digital Logic Design
Gate Circuits and Boolean Equations
Complement of a Function
CHAPTER 2 Boolean Algebra This chapter in the book includes:
Princess Sumaya University
SLIDES FOR CHAPTER 2 BOOLEAN ALGEBRA
ECE 2110: Introduction to Digital Systems
Computer Architecture CST 250
Karnaugh Maps.
ECE 331 – Digital System Design
Boolean Algebra Why study Boolean Algebra?
Boolean Algebra.
Lecture 3: Incompletely Specified Functions and K Maps
Lecture 4 Sums of Product Circuits Simplification
COE 202: Digital Logic Design Combinational Logic Part 2
Boolean Algebra.
ECE 331 – Digital System Design
Digital Systems Design
Chapter 3 Gate-level Minimization.
COE 202: Digital Logic Design Combinational Logic Part 3
Overview Part 2 – Circuit Optimization
Lecture 3: Incompletely Specified Functions and K Maps
Circuit Simplification and
ECE 331 – Digital System Design
Presentation transcript:

Chapter 2 Combinational Systems Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Continuing Examples (CE) CE1. A system with four inputs, A, B, C, and D, and one output, Z, such that Z=1 if three of the inputs are 1. CE2. A single light (that can be on or off) that can be controlled by any one of three switches. One switch is the master on/off switch. If it is off, the lights are off. When the master switch is on, a change in the position of one of the other switches (from up to down or from down to up) will cause the light to change state. CE3. A system to do 1 bit of binary addition. It has three inputs (the 2 bits to be added plus the carry from the next lower order bit) and produces two outputs, a sum bit and a carry to the next higher order position. CE4. A system that has as its input the code for a decimal digit, and produces as its output the signals to drive a seven-segment display, such as those on most digital watches and numeric displays (more later). CE5. A system with nine inputs, representing two 4-bit binary numbers and a carry input, and one 5-bit output, representing the sum. (Each input number can range from 0 to 15; the input can range from 0 to 31.)

Step 1: Represent each of the inputs and output in binary. Step 1.5: If necessary, break the problem into smaller subproblems. Step 2: Formalize the design specification either in the form of a truth table or of an algebraic expression. Step 3: Simplify the description. Step 4: Implement the system with the available components, subject to the design objectives and constraints.

OR (written as +) a + b (read a OR b) is 1 if and only if a = 1 or b = 1 or both. AND (written as · or simply two variables catenated) a · b = ab (read a AND b) is 1 if and only if a = 1 and b = 1. NOT (written´) a´ (read NOT a) is 1 if and only if a = 0.

Definitions A literal is the appearance of a variable or its complement. A product term is one or more literals connected by AND operators. A standard product term, also minterm is a product term that includes each variable of the problem, either uncomplemented or complemented. A sum of products expression (often abbreviated SOP) is one or more product terms connected by OR operators. A canonical sum or sum of standard product terms is just a sum of products expression where all of the terms are standard product terms.

A minimum sum of products expression is one of those SOP expressions for a function that has the fewest number of product terms. If there is more than one expression with the fewest number of terms, then minimum is defined as one or more of those expressions with the fewest number of literals. (1) x´yz´ + x´yz + xy´z´ + xy´z + xyz 5 terms, 15 literals (2) x´y + xy´ + xyz 3 terms, 7 literals (3) x´y + xy´ + xz 3 terms, 6 literals (4) x´y + xy´ + yz 3 terms, 6 literals

A sum term is one or more literals connected by OR operators. A standard sum term, also called a maxterm, is a sum term that includes each variable of the problem, either uncomplemented or complemented. A product of sums expression (POS) is one or more sum terms connected by AND operators. A canonical product or product of standard sum terms is just a product of sums expression where all of the terms are standard sum terms. SOP: x´y + xy´ + xyz POS: (x + y´)(x´ + y)(x´ + z´) Both: x´ + y + z or xyz´ Neither: x(w´ + yz) or z´ + wx´y + v(xz + w´)

f is 1 if a = 0 AND b = 1 OR if a = 1 AND b = 0 OR if a = 1 AND b = 1 f is 1 if a´ = 1 AND b = 1 OR if a = 1 AND b´ = 1 OR if a = 1 AND b = 1 f is 1 if a´b = 1 OR if ab´ = 1 OR if ab = 1 f = a´b + ab´ + ab

For any two product terms where exactly one variable appears uncomplemented in one and complemented in the other, the consensus is defined as the product of the remaining literals. If no such variable exists or if more than one such variable exists, then the consensus us undefined. If we write one term as at1 and the second as a´t2 (where t1 and t2 represent product terms), then, if the consensus is defined. at1 ¢ a´t2 = t1t2 P13a. at1 + a´t2 + t1t2 = at1 + a´t2 P13b. (a + t1)(a + t2)(t1 + t2)= (a + t1)(a + t2)

G = DE´ + A´B´C + CD´E + ABC´E G = C´ (A´B´ + ABE) + DE´ + CD´E G = C´ (B´ + E)(B + A´) + DE´ + CD´E G = (C´ + D´ E)[C + (B´ + AE)(B + A´)] + DE´