ECE 301 – Digital Electronics Minterm and Maxterm Expansions and Incompletely Specified Functions (Lecture #6) The slides included herein were taken from.

Slides:



Advertisements
Similar presentations
Logical Systems Synthesis.
Advertisements

ECE 301 – Digital Electronics Karnaugh Maps (Lecture #7) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design,
ECE 301 – Digital Electronics Circuit Design and Analysis (Lecture #9A) The slides included herein were taken from the materials accompanying Fundamentals.
ECE 331 – Digital System Design Boolean Algebra (Lecture #3) The slides included herein were taken from the materials accompanying Fundamentals of Logic.
ECE 331 – Digital System Design
ECE 331 – Digital System Design
CS 140 Lecture 2 Combinational Logic CK Cheng 4/04/02.
CS 151 Digital Systems Design Lecture 6 More Boolean Algebra A B.
CK Cheng Tuesday 10/2/02 CS 140 Lecture 2. Part I. Combinational Logic I) Specification –a. Language –b. Truth Table –c. Boolean Algebra –d. Incompletely.
Contemporary Logic Design Two-Level Logic © R.H. Katz Transparency No. 3-1 Chapter #2: Two-Level Combinational Logic Section 2.1, Logic Functions.
ECE 301 – Digital Electronics Boolean Algebra and Standard Forms of Boolean Expressions (Lecture #4) The slides included herein were taken from the materials.
ECE 331 – Digital System Design Multi-level Logic Circuits and NAND-NAND and NOR-NOR Circuits (Lecture #8) The slides included herein were taken from the.
Canonical Forms and Logic Miniminization
ECE 331 – Digital System Design Karnaugh Maps and Determining a Minimal Cover (Lecture #7) The slides included herein were taken from the materials accompanying.
ECE 331 – Digital System Design
ECE 301 – Digital Electronics Karnaugh Maps and Determining a Minimal Cover (Lecture #8) The slides included herein were taken from the materials accompanying.
Chapter 2: Boolean Algebra and Logic Functions
Lecture 4 Logic gates and truth tables Implementing logic functions
4.1 Conversion of English Sentences to Boolean Equations
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
1 Simplification of Boolean Functions:  An implementation of a Boolean Function requires the use of logic gates.  A smaller number of gates, with each.
ECE 331 – Digital System Design NAND and NOR Circuits, Multi-level Logic Circuits, and Multiple-output Logic Circuits (Lecture #9) The slides included.
ECE 2110: Introduction to Digital Systems PoS minimization Don’t care conditions.
ECE 331 – Digital System Design Circuit Design and Analysis (Lecture #9A) The slides included herein were taken from the materials accompanying Fundamentals.
Chapter 2 Two- Level Combinational Logic. Chapter Overview Logic Functions and Switches Not, AND, OR, NAND, NOR, XOR, XNOR Gate Logic Laws and Theorems.
Venn Diagram – the visual aid in verifying theorems and properties 1 E.
1 Minterm and Maxterm Expressions Definition: a minterm of n variables is a product of the variables in which each appears exactly once in true or complemented.
Based on slides by:Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. ECE/CS 352: Digital System Fundamentals Lecture 6 – Canonical Forms.
05 BA2 Page 1 ECEn/CS 224 Boolean Algebra – Part 2.
Module –I Switching Function
ECE2030 Introduction to Computer Engineering Lecture 6: Canonical (Standard) Forms Prof. Hsien-Hsin Sean Lee School of Electrical and Computer Engineering.
C.S.Choy39 TERMINOLOGY Minterm –product term containing all input variables of a function in either true or complementary form Maxterm – sum term containing.
CEC 220 Digital Circuit Design SOP and POS forms Friday, January 23 CEC 220 Digital Circuit Design Slide 1 of 17.
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 331 – Digital System Design Basic Logic Operations, Boolean Expressions and Truth Tables, and Standard Logic Gates The slides included herein were.
ECE 301 – Digital Electronics Minimizing Boolean Expressions using K-maps, The Minimal Cover, and Incompletely Specified Boolean Functions (Lecture #6)
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.
School of Computer and Communication Engineering, UniMAP DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan.
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.
CEC 220 Digital Circuit Design Minterms and Maxterms Monday, January 26 CEC 220 Digital Circuit Design Slide 1 of 11.
©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.
Digital Logic Design. Truth Table  Logic Circuit 1. Start with truth table 2. When your output is a 1, figure out the combination of inputs, ANDs, and.
Digital Logic.
ECE 301 – Digital Electronics
Lecture 4 Logistics Last lecture --- Boolean algebra Today’s lecture
Prof. Hsien-Hsin Sean Lee
Chapter 2: Boolean Algebra and Logic Functions
Complement of a Function
Boolean Expressions Lecture No. 10.
ECE 331 – Digital System Design
ECE 331 – Digital System Design
CSE 311 Foundations of Computing I
ECE 331 – Digital System Design
CSE 370 – Winter Combinational Logic - 1
ECE 331 – Digital System Design
Combinatorial Logic Circuit
ECE 301 – Digital Electronics
January 19 W’05 Yutao He 4532B Boelter Hall CSM51A/EEM16-Sec.1 W’05
ECE 331 – Digital System Design
Lecture 5 Logistics Last lecture Today’s lecture
Principles & Applications
Karnaugh Map Method By: Asst Lec. Besma Nazar Nadhem
ECE 331 – Digital System Design
Presentation transcript:

ECE 301 – Digital Electronics Minterm and Maxterm Expansions and Incompletely Specified Functions (Lecture #6) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design, 6 th Edition, by Roth and Kinney, and were used with permission from Cengage Learning.

Spring 2011ECE Digital Electronics2 Minterms and Maxterms

Spring 2011ECE Digital Electronics3 Minterm In general, a minterm of n variables is a product (ANDing) of n literals in which each variable appears exactly once in either true or complemented form, but not both.  A literal is a variable or its complement. For a given row in the truth table, the corresponding minterm is formed by  Including the true form a variable if its value is 1.  Including the complemented form of a variable if its value is 0.

Spring 2011ECE Digital Electronics4 Minterms

Spring 2011ECE Digital Electronics5 Minterm Expansion When a function f is written as a sum (ORing) of minterms, it is referred to as a minterm expansion or a standard sum of products.  aka. “canonical sum of products”  aka. “disjunctive normal form” If f = 1 for row i of the truth table, then m i must be present in the minterm expansion. The minterm expansion for a function f is unique.  However, it is not necessarily the lowest cost.

Spring 2011ECE Digital Electronics6 Minterm Expansion The minterm expansion for a general function of 3 variables can be written as follows: Denotes the logical sum operation a i = 0 or 1. 3 variables This can be extended to n variables

Spring 2011ECE Digital Electronics7 Minterm Expansion: Example #1 Determine the minterm expansion for the function defined by the following truth table: ABCF

Spring 2011ECE Digital Electronics8 Minterm Expansion: Example #2 Determine the minterm expansion for each of the following Boolean expressions: F 1 (A,B,C) = A.B.C' + A.B'.C + A'.B'.C + A.B.C F 2 (A,B,C) = A.C' + A.B + B'.C

Spring 2011ECE Digital Electronics9 Maxterm In general, a maxterm of n variables is a sum (ORing) of n literals in which each variable appears exactly once in either true or complemented form, but not both.  A literal is a variable or its complement. For a given row in the truth table, the corresponding maxterm is formed by  Including the true form a variable if its value is 0.  Including the complemented form of a variable if its value is 1.

Spring 2011ECE Digital Electronics10 Maxterms

Spring 2011ECE Digital Electronics11 Maxterm Expansion When a function f is written as a product (ANDing) of maxterms, it is referred to as a maxterm expansion or a standard product of sums.  aka. “canonical product of sums”  aka. “conjunctive normal form” If f = 0 for row i of the truth table, then M i must be present in the maxterm expansion. The maxterm expansion for a function f is unique.  However, it is not necessarily the lowest cost.

Spring 2011ECE Digital Electronics12 Maxterm Expansion The maxterm expansion for a general function of 3 variables can be written as follows: Denotes the logical product operation a i = 0 or 1. 3 variables This can be extended to n variables

Spring 2011ECE Digital Electronics13 Maxterm Expansion: Example #1 Determine the maxterm expansion for the function defined by the following truth table: ABCF

Spring 2011ECE Digital Electronics14 Maxterm Expansion: Example #2 Determine the maxterm expansion for each of the following Boolean expressions: F 1 (A,B,C) = (A+B+C').(A+B'+C).(A'+B'+C).(A+B+C) F 2 (A,B,C) = (A+C').(A+B).(B'+C)

Spring 2011ECE Digital Electronics15 Minterm and Maxterm Expansions What is the relationship between the minterm expansion and maxterm expansion for the same function?

Spring 2011ECE Digital Electronics16 Minterm and Maxterm Expansions What is the relationship between the minterm expansion for a function and that for the complement of the function? What about the maxterm expansion?

Spring 2011ECE Digital Electronics17 Minterm and Maxterm Expansions

Spring 2011ECE Digital Electronics18 Logic Circuits A function f can be represented by either a minterm expansion or a maxterm expansion. Both forms of the function can be realized using logic gates that implement the basic logic operations. Minterm Expansion (Standard SOP)  Consists of the sum (OR) of product (AND) terms.  Realized using an AND-OR circuit. Maxterm Expansion (Standard POS)  Consists of the product (AND) of sum (OR) terms.  Realized using an OR-AND circuit.

Spring 2011ECE Digital Electronics19 Logic Circuits: Example For the function defined by the following truth table, 1. Determine the minterm expansion 2. Draw the circuit diagram ABCF

Spring 2011ECE Digital Electronics20 Logic Circuits: Example For the same function, 1. Determine the maxterm expansion 2. Draw the circuit diagram Which logic circuit is “cheaper”?

Spring 2011ECE Digital Electronics21 Incompletely Specified Functions

Spring 2011ECE Digital Electronics22 Incompletely Specified Functions A function f is completely specified when its output is defined (i.e. either 0 or 1) for all combinations of its inputs. However, if the output of a function f is not defined for all combinations of its inputs, then it is said to be incompletely specified.  Those combinations of the inputs for which the output of function f is not defined are referred to as “don't care” outputs.

Spring 2011ECE Digital Electronics23 Incompletely Specified Functions The truth table representing an incompletely specified function includes an “x” (or a “d”) in each row corresponding to an input combination for which the output is not defined. ABCF X X X 1111 “don't care” for ABC = 001 “don't care” for ABC = 011 “don't care” for ABC = 110

Spring 2011ECE Digital Electronics24 Incompletely Specified Functions ABCF X X X 1111 The minterm expansion is: The maxterm expansion is: F(A,B,C) =  m(2,4,7) +  d(1,3,6) F(A,B,C) =  M(0,5).  D(1,3,6) “don't care” minterms “don't care” maxterms A “don't care” can be either a 0 or 1.  Select a value for each “don't care” that will help simplify the function.

Spring 2011ECE Digital Electronics25 Incompletely Specified Functions ABCF X X X Assume X1 = 0, X2 = 0, X3 = 0: Assume X1 = 1, X2 = 1, X3 = 1: F(A,B,C) = A'BC' + AB'C' + ABC F(A,B,C) = B + AC' + A'C Assume X1 = 0, X2 = 1, X3 = 1: F(A,B,C) = B + AC'

Spring 2011ECE Digital Electronics26 Questions?