0% found this document useful (0 votes)
734 views

07-Minterm Maxterm PDF

The document provides an overview of minterm and maxterm expansions in digital logic. It defines minterms as products of literals where each variable appears once in complemented or uncomplemented form. Maxterms are defined as sums of literals where each variable appears once in true or complemented form. Examples are given to demonstrate how to write logic functions as sums of minterms or products of maxterms based on their truth tables. Notation is introduced to write minterm expansions more concisely using row numbers from ordered truth tables.
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
734 views

07-Minterm Maxterm PDF

The document provides an overview of minterm and maxterm expansions in digital logic. It defines minterms as products of literals where each variable appears once in complemented or uncomplemented form. Maxterms are defined as sums of literals where each variable appears once in true or complemented form. Examples are given to demonstrate how to write logic functions as sums of minterms or products of maxterms based on their truth tables. Notation is introduced to write minterm expansions more concisely using row numbers from ordered truth tables.
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

12/31/2010

Overview

• Minterm Expansions
• Maxterm Expansions
• Minterms and Maxterms from Switching
07-Minterm and Maxterm Expansions Expressions
Text: Unit 4

ECEGR/ISSC 201
Digital Operations and Computations
Winter 2011

Dr. Louie 2

Minterm Expansions Minterm Expansions

• A minterm of n variables is the product of n • Each minterm will be equal to 1 for one
literals in which each variable appears once in combination of the variables (in this case, A,B,C)
either a complemented or uncomplemented form • Consider:
A B C
• F = A’BC + AB’C’ + AB’C +ABC has four
0 0 0
minterms
0 0 1
• F = AC is not a minterm because B is not
0 1 0
present; we can write this expression as
0 1 1
 F = AC(B’+B) = ACB’ + ACB; ACB’ and ACB are 1 0 0
minterms
1 0 1
1 1 0
1 1 1

Dr. Louie 3 Dr. Louie 4

Minterm Expansions Minterm Expansions

• The minterms and associated A,B,C • For our example:


combinations: F = A’BC + AB’C’ + AB’C +ABC

A B C minterms A B C F minterms
0 0 0 A’B’C’ 0 0 0 0 A’B’C’
0 0 1 A’B’C Four minterms, 0 0 1 0 A’B’C
0 1 0 A’BC’ four 1s 0 1 0 0 A’BC’
0 1 1 A’BC 0 1 1 1 A’BC
1 0 0 AB’C’ 1 0 0 1 AB’C’
1 0 1 AB’C 1 0 1 1 AB’C
1 1 0 ABC’ 1 1 0 0 ABC’
1 1 1 ABC 1 1 1 1 ABC

Dr. Louie 5 Dr. Louie 6

1
12/31/2010

Minterm Notation Minterm Notation

• There is shorthand for writing expressions that • If we order the truth table consistently such that
have been expanded in minterms the first row is always A=0, B=0, C=0, the
• Note that each row in truth table corresponds to second row is always A = 0, B =0, C =1… and the
one minterm (which may or may not be present eight row is A=1, B=1, C=1 then we can
in an expansion of F) correlate minterm with row number
• Example: row 4=> A=1, B =0, C=0 =>AB’C’

Dr. Louie 7 Dr. Louie 8

Minterm Notation Minterm Notation

• F = A’BC + AB’C’ + AB’C +ABC • F = m3 + m4 + m5 + m7


• Also written as: F = m3 + m4 + m5 + m7 • In more simplified form: F A, B, C m(3, 4, 5, 7)

Row A B C F minterms Row A B C F minterms

0 0 0 0 0 A’B’C’ 0 0 0 0 0 A’B’C’
1 0 0 1 0 A’B’C 1 0 0 1 0 A’B’C
2 0 1 0 0 A’BC’ 2 0 1 0 0 A’BC’
3 0 1 1 1 A’BC 3 0 1 1 1 A’BC
4 1 0 0 1 AB’C’ 4 1 0 0 1 AB’C’
5 1 0 1 1 AB’C 5 1 0 1 1 AB’C
6 1 1 0 0 ABC’ 6 1 1 0 0 ABC’
7 1 1 1 1 ABC 7 1 1 1 1 ABC

Dr. Louie 9 Dr. Louie 10

Example Example

• Write the minterms of the truth table • Write the minterms of the truth table
F = A’B’C’ + AB’C’ + ABC F ( A, B, C ) m(0, 4, 7)
A B C F
Row A B C F minterms
0 0 0 1
0 0 0 0 1 A’B’C’
0 0 1 0
1 0 0 1 0 A’B’C
0 1 0 0
2 0 1 0 0 A’BC’
0 1 1 0
3 0 1 1 0 A’BC
1 0 0 1
4 1 0 0 1 AB’C’
1 0 1 0
5 1 0 1 0 AB’C
1 1 0 0
6 1 1 0 0 ABC’
1 1 1 1
7 1 1 1 1 ABC

Dr. Louie 11 Dr. Louie 12

2
12/31/2010

Maxterm Expansions Maxterm Expansions

• Minterms correspond to a sum of products • F = (A+B+C)(A’+B’+C) has two maxterms


expression • F = (A+C)(A’ + B’ + C) is not in maxterm form
• Maxterms correspond to a product of sums • F = (AB+C)(A’+B’+C) is not in maxterm form
• A maxterm of n variables is a sum of n literals in
which each literal appears exactly once in true or
complemented form, but not both

Dr. Louie 13 Dr. Louie 14

Max Expansions Maxterm Expansions

• Each maxterm will be equal to 0 for one • F =(A+B+C)(A+B+C’)(A+B’+C)(A’+B’+C)


combination of the variables
• From our example:
A B C F maxterms
F =(A+B+C)(A+B+C’)(A+B’+C)(A’+B’+C)
0 0 0 0 A+B+C
Four maxterms, 0 0 1 0 A+B+C’
four 0s 0 1 0 0 A+B’+C
0 1 1 1 A+B’+C’
1 0 0 1 A’+B+C
1 0 1 1 A’+B+C’
1 1 0 0 A’+B’+C
1 1 1 1 A’+B’+C’

Dr. Louie 15 Dr. Louie 16

Minterms and Maxterms


Maxterm Notation
from Switching Expressions
• F(A,B,C) = M0M1M2M6 • Can easily find minterm or maxterm from a truth
• Also written as: F A, B, C M(0, 1, 2, 6) table
• Truth tables can be cumbersome to create if the
Row A B C F maxterms
number of variables is large
0 0 0 0 0 A+B+C
• Algebraic way:
1 0 0 1 0 A+B+C’
 Write the expression as a sum of products and
2 0 1 0 0 A+B’+C
introduce missing variables using (X + X’) =1 (for
3 0 1 1 1 A+B’+C’
minterm) or XX’ (for maxterm)
4 1 0 0 1 A’+B+C
5 1 0 1 1 A’+B+C’
6 1 1 0 0 A’+B’+C
7 1 1 1 1 A’+B’+C’

Dr. Louie 17 Dr. Louie 18

3
12/31/2010

Minterms and Maxterms Minterms and Maxterms


from Switching Expressions from Switching Expressions
• For example, given: • To write as Maxterm:
 F = A’B’ + AC  F = A’B’ + AC
• Introduce the missing variable in each product • Factor into product of sums (second distributive
using (X + X’) = 1 law)
 F = A’B’(C +C’) + A(B +B’)C  F = (A’B’ + A)(A’B’ + C)
• Expand (with reordering) and find decimal  F = (A + A’)(A+B’)(C+A’)(C+B’)
notation: • Using XX’=0
 F = A’B’C’ + A’B’C + AB’C + ABC  F= (A+B’+CC’)(C+A’ + BB’)(AA’+ C+B’)
(000) (001) (101) (111) • Using (X +Y)(X +Y’) = X
• So F A, B, C m 0, 1, 5, 7  F=(A+B’+C)(A+B’+C’)(A’+C+B)(A’+C+B’)(A+B’+C)
(A’+B’+C)

Dr. Louie 19 Dr. Louie 20

Minterms and Maxterms Minterms and Maxterms


from Switching Expressions from Switching Expressions
• Removing redundant terms: • F = A’B’ + AC
• F=(A+B’+C)(A+B’+C’)(A’+B+C)(A’+B’+C)(A+B’+C) • Minterms should match F =1: F A, B, C m 0, 1, 5, 7
(A’+B’+C)
• Reordering Row A B C F minterms maxterms

• F=(A+B’+C)(A+B’+C’)(A’+B+C)(A’+B’+C)
0 0 0 0 1 A’B’C’ A+B+C
• Into decimal notation (complements are 1, 1 0 0 1 1 A’B’C A+B+C’
uncomplemented are 0): 2 0 1 0 0 A’BC’ A+B’+C
 010 011 100 110 3 0 1 1 0 A’BC A+B’+C’
• Gives: F A, B, C M(2, 3, 4, 6) 4 1 0 0 0 AB’C’ A’+B+C
5 1 0 1 1 AB’C A’+B+C’
6 1 1 0 0 ABC’ A’+B’+C
7 1 1 1 1 ABC A’+B’+C’

Dr. Louie 21 Dr. Louie 22

Minterms and Maxterms


Example
from Switching Expressions
• F = A’B’ + AC • Find the minterm expansion of
• Maxterms should match F =0: F A, B, C M(2, 3, 4, 6)  F = A’(B’+D)+ACD’
• Basic steps:
Row A B C F minterms maxterms
 Expand into SoP form (if necessary)
0 0 0 0 1 A’B’C’ A+B+C
 Use (X + X’) =1 to add missing variables to each
1 0 0 1 1 A’B’C A+B+C’
product
2 0 1 0 0 A’BC’ A+B’+C
 Multiply out
3 0 1 1 0 A’BC A+B’+C’
4 1 0 0 0 AB’C’ A’+B+C
 Remove redundant terms
5 1 0 1 1 AB’C A’+B+C’  Convert to decimal notation
6 1 1 0 0 ABC’ A’+B’+C
7 1 1 1 1 ABC A’+B’+C’

Dr. Louie 23 Dr. Louie 24

4
12/31/2010

Example Example

• F = A’(B’+D)+ACD’ • Remove redundant terms


• First expand into SoP form • F=A’B’C’D’ + A’B’C’D + A’B’CD’ + A’B’CD +
 F=A’B’ + A’D +ACD’ A’B’C’D + A’B’CD + A’BC’D + A’BCD + ABCD’ +
• Use (X + X’) =1 to add missing variables AB’CD’
 F=A’B’(C + C’)(D +D’) + A’D(B+B’)(C+C’) • Place in decimal notation
+A(B+B’)CD’ • F=A’B’C’D’ + A’B’C’D + A’B’CD’ + A’B’CD + A’BC’D
• Multiply out (0000) (0001) (0010) (0011) (0101)
• F=A’B’C’D’ + A’B’C’D + A’B’CD’ + A’B’CD + + A’BCD + ABCD’ + AB’CD’
A’B’C’D + A’B’CD + A’BC’D + A’BCD + ABCD’ + (0111) (1110) (1010)
AB’CD’
F A, B, C , D m 0, 1, 2, 3, 5, 7, 10, 14

Dr. Louie 26 Dr. Louie 27

Example Example

• Check the truth table • Check the truth table


F = A’(B’+D)+ACD’ F = A’(B’+D)+ACD’ F A, B, C , D m 0, 1, 2, 3, 5, 7, 10, 14

Row A B C D F Row A B C D F Row A B C D F Row A B C D F

0 0 0 0 0 8 1 0 0 0 0 0 0 0 0 1 8 1 0 0 0 0
1 0 0 0 1 9 1 0 0 1 1 0 0 0 1 1 9 1 0 0 1 0
2 0 0 1 0 10 1 0 1 0 2 0 0 1 0 1 10 1 0 1 0 1
3 0 0 1 1 11 1 0 1 1 3 0 0 1 1 1 11 1 0 1 1 0
4 0 1 0 0 12 1 1 0 0 4 0 1 0 0 0 12 1 1 0 0 0
5 0 1 0 1 13 1 1 0 1 5 0 1 0 1 1 13 1 1 0 1 0
6 0 1 1 0 14 1 1 1 0 6 0 1 1 0 0 14 1 1 1 0 1
7 0 1 1 1 15 1 1 1 1 7 0 1 1 1 1 15 1 1 1 1 0

Dr. Louie 28 Dr. Louie 29

Minterms and Maxterms Minterms and Maxterms


from Switching Expressions from Switching Expressions
• If given the minterm expansion for F, then the • If given the minterm expansion for F’, then the
maxterms are those numbers not in the minterm minterm expansion of F are those numbers not in
expansion the minterm expansion of F’
• If given the maxterm expansion for F, then the • If given the maxterm expansion for F’, then the
minterms are those numbers not in the maxterm maxterm expansion of F are those numbers not
expansion in the maxterm expansion of F’

Dr. Louie 30 Dr. Louie 31

5
12/31/2010

Minterms and Maxterms Minterms and Maxterms


from Switching Expressions from Switching Expressions
• If given the minterm expansion for F, then the • If F A, B, C M(2, 3, 4, 6)
maxterm expansion of F’ are the same numbers Then F A, B, C m 0, 1, 5, 7
as the minterms of F
• If given the maxterm expansion for F, then the • If F A, B m 0
minterm expansion of F’ are the same numbers
as the maxterms of F Then F A, B M(1, 2, 3,)

• If F ' A, B m 0, 3
Then F A, B m 1, 2

• If F A, B, C m 3, 4, 5, 6, 7
Then F ' A, B, C M(3, 4, 5, 6, 7)

Dr. Louie 32 Dr. Louie 33

You might also like