07-Minterm Maxterm PDF
07-Minterm Maxterm PDF
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
• 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
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
1
12/31/2010
• 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’
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
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
2
12/31/2010
3
12/31/2010
• 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’
4
12/31/2010
Example Example
Example Example
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
5
12/31/2010
• 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)