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.

Slides:



Advertisements
Similar presentations
Morgan Kaufmann Publishers
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 Minterm and Maxterm Expansions and Incompletely Specified Functions (Lecture #6) The slides included herein were taken from.
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.
Chapter 2: Boolean Algebra and Logic Functions
Digital Logic and Design Vishal Jethva Lecture No. 10 svbitec.wordpress.com.
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.
Lecture 2 – Boolean Algebra Lecturer: Amy Ching Date: 21 st Oct 2002.
طراحی مدارهای منطقی نیمسال دوم دانشگاه آزاد اسلامی واحد پرند.
BOOLEAN ALGEBRA Saras M. Srivastava PGT (Computer Science)
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.
1 Simplification of Boolean Functions:  An implementation of a Boolean Function requires the use of logic gates.  A smaller number of gates, with each.
1 Representation of Logic Circuits EE 208 – Logic Design Chapter 2 Sohaib Majzoub.
Department of Computer Engineering
Combinational Logic 1.
Computer Engineering (Logic Circuits) (Karnaugh Map)
CHAPTER 3: PRINCIPLES OF COMBINATIONAL LOGIC
LOGIC GATES & BOOLEAN ALGEBRA
Ahmad Almulhem, KFUPM 2010 COE 202: Digital Logic Design Combinational Logic Part 3 Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:
05 BA2 Page 1 ECEn/CS 224 Boolean Algebra – Part 2.
Chap 2. Combinational Logic Circuits
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
Binary Logic and Gates Boolean Algebra Canonical and Standard Forms Chapter 2: Boolean Algebra and Logic Gates.
Boolean Algebra & Logic Circuits Dr. Ahmed El-Bialy Dr. Sahar Fawzy.
Conversion from one number base to another Binary arithmetic Equation simplification DeMorgan’s Laws Conversion to/from SOP/POS Reading equations from.
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.
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
BR 2/1/991 Truth Tables (again) Recall that a boolean equation can be represented by a Truth Table A B C F
C.S.Choy39 TERMINOLOGY Minterm –product term containing all input variables of a function in either true or complementary form Maxterm – sum term containing.
1 Example: Groupings on 3-Variable K-Maps BC F(A,B,C) = A ’ B ’ A BC F(A,B,C) = B ’ A
CSE 140: Components and Design Techniques for Digital Systems Lecture 3: Incompletely Specified Functions and K Maps CK Cheng Dept. of Computer Science.
Digital Logic (Karnaugh Map). Karnaugh Maps Karnaugh maps (K-maps) are graphical representations of boolean functions. One map cell corresponds to a row.
ECE DIGITAL LOGIC LECTURE 8: BOOLEAN FUNCTIONS Assistant Prof. Fareena Saqib Florida Institute of Technology Spring 2016, 02/11/2016.
ECE 301 – Digital Electronics Minimizing Boolean Expressions using K-maps, The Minimal Cover, and Incompletely Specified Boolean Functions (Lecture #6)
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.
CSE 260 BRAC University.
1 EENG 2710 Chapter 3 Simplification of Switching Functions.
1 CS 352 Introduction to Logic Design Lecture 2 Ahmed Ezzat Boolean Algebra and Its Applications Ch-3 + Ch-4.
©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.
De Morgan’s Theorem,.
Chapter 2: Boolean Algebra and Logic Functions
DeMorgan’s Theorem DeMorgan’s 2nd Theorem
Complement of a Function
CS 352 Introduction to Logic Design
Karnaugh Maps.
ECE Digital logic Lecture 10: Karnaugh MAps
Digital Logic and Design
Optimized Implementation of Logic Function
ECE 331 – Digital System Design
CHAPTER 5 KARNAUGH MAPS 5.1 Minimum Forms of Switching Functions
Combinatorial Logic Circuit
January 19 W’05 Yutao He 4532B Boelter Hall CSM51A/EEM16-Sec.1 W’05
COE 202: Digital Logic Design Combinational Logic Part 3
Lecture 4 Minterm and Maxterm
CHAPTER 3 BOOLEAN ALGEBRA (continued)
Overview Part 2 – Circuit Optimization
3-Variable K-map AB/C AB/C A’B’ A’B AB AB’
Analysis of Logic Circuits Example 1
Analysis of Logic Circuits Example 1
Laws & Rules of Boolean Algebra
ECE 331 – Digital System Design
Presentation transcript:

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 form. e.g.: minterms of 3 variables: - Each minterm = 1 for only one combination of values of the variables, = 0 otherwise. Definition: a maxterm of n variables is a sum of the variables in which each appears exactly once in true or complemented form. e.g.: 3 variables - Each maxterm = 0 for only one combination of values of the variables, = 1 otherwise. ABC A’BC AB’C 2 n terms, n = no. variables 2 3 = 8 A+B+C A’+B+C A’+B’+C

2 All possible minterms and maxterms are obtained from the truth table: e.g. recall from our votetaker: F = ABC + ABC' + AB'C + A'BC which can be written in terms of minterms as F = m 3 + m 5 + m 6 + m 7 Row # ABCMintermsMaxterms AB'C'=A'+B+C= 5101AB'C=A'+B+C'= 6110ABC'=A'+B'+C= 7111ABC=A'+B'+C'= e.g. 3 variables How do we write minterm and maxterm expansions? value =1 value = 0 A’B’C’ m 0 A+B+C M 0 A’B’C m 1 A+B+C’ M 1 A’BC’ m 2 A+B’+C M 2 A’BC m 3 A+B’+C’ M 3 m 4 M 4 m 5 M 5 m 6 M 6 m 7 M

3 Minterms & Maxterms (continued) which is abbreviated as F(A,B,C) = - For each F = 1 row of truth table, only one m i = 1. Therefore the minterm expansion is unique, i.e. there is a 1 to 1 correspondence between each minterm and each 1 in the truth table. - Alternate form of F: F = ( A + B + C ) ( A + B + C' ) ( A + B' + C ) ( A' + B + C ) or in terms of maxterms: F = or F(A,B,C) = - For each F = 0, only one M i = 0. Therefore maxterm expansion is unique.  m (3,5,6,7) all others = 0 ( ) ( )( )( ) M0M1M2M4M0M1M2M4  M (0,1,2,4)  F =  m (3,5,6,7) =  M (0,1,2,4)

4 Minterms & Maxterms (continued) (Note that we have been given a "simplified" expression, and we want to find the minterm expansion. This is moving in the opposite direction to what we did before, i.e. writing F from the truth table, and then simplifying). -Note that if m i is present in minterm expansion, then M i is not present in maxterm expansion, and conversely. - Note also that: F' = - To convert from a general expression to a minterm or maxterm expansion, use: a) truth table orb) algebraic manipulation e.g. Find the minterm expansion of: F = AB' + A'C ABCF  m (0,1,2,4) =  M (3,5,6,7)

5 Minterms & Maxterms (continued) b) Algebraically: use X + X' = 1 to introduce the missing variables in each term. Therefore F = AB' + A'C = Solution of F = AB' + A'C a) Using truth table: Therefore F = = ABCF Evaluate F A’B’C+A’BC+AB’C’+AB’C m 1 + m 3 + m 4 + m 5  m (1,3,4,5) AB’(C+C’) + A’C(B+B’) = AB’C + AB’C’ + A’BC + A’B’C = m 5 + m 4 + m 3 + m 1 =  m (1,3,4,5)

6 Example Find the maxterm expansion of F = ( A + B' ) ( A' + C ) b) Use XX' = 0 to introduce missing variables in each term Therefore F = = - Minterm and maxterm expansions are unique, therefore can prove equation F = G is valid by finding minterm or maxterm expansions of both sides, and demonstrating the equality. a)Truth Table  F =  (2,3,4,6) X+YZ=(X+Y)(X+Z) (A+B’+C)(A+B’+C’)(A’+B+C)(A’+B’+C)  (2,3,4,6) (A + B’+ CC’)(A’ + C + BB’) x yz

7 Incompletely Specified Functions In some applications, certain combinations of inputs never occur, or the output from certain combinations of inputs may be irrelevant. e.g.: The binary number in BCD should never occur. In a truth table, the function F (at the output) is not important in such cases and is said to be incompletely specified. We don't care what value (0 or 1) is assigned to F. e.g.: A function of 3 variables; consider the truth table: ABCF X10111X211X10111X21 F is incompletely Specified X 1 X 2 could be 00, 01, 10, 11 What values do we assign?? Ans. Choose values such that F is in simplest form.

8 Incompletely Specified Functions(continued) -When we expand F in minterm or maxterm, we must specify each x as 0 or 1. We should choose the values of x to produce the simplest form for F. Easiest to do this using a Karnaugh map (next topic). - - In previous eg., simplest form for F is obtained by assigning 1 to 1st X 1 0 to 2nd X 2 yielding F = after simplification Formal minterm expansion would be written: F = A’B + BC 4 times with X 1, X 2 = 0, 1  m ( 0, 3, 7) +  d ( 1, 6) Required terms + don’t care minterms