Scribd
Upload
128 views18 pages

Minterm and Maxterm: Conversion of English Sentences To Boolean Equations. - Example

This document discusses minterms and maxterms in combinational logic circuits. 1) It defines minterms and maxterms as products and sums of literals, where each variable appears once. Functions can be written as sums of minterms or products of maxterms. 2) It provides examples of converting between minterm and maxterm representations using 3 variables. Complement of a minterm is the corresponding maxterm. 3) Applications discussed include deriving logic expressions from truth tables and handling don't care terms in incompletely specified functions. Examples of full adders and 2's complement adders are also presented.

Uploaded by

Nashit Ahmed Barq
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
128 views18 pages

Minterm and Maxterm: Conversion of English Sentences To Boolean Equations. - Example

This document discusses minterms and maxterms in combinational logic circuits. 1) It defines minterms and maxterms as products and sums of literals, where each variable appears once. Functions can be written as sums of minterms or products of maxterms. 2) It provides examples of converting between minterm and maxterm representations using 3 variables. Complement of a minterm is the corresponding maxterm. 3) Applications discussed include deriving logic expressions from truth tables and handling don't care terms in incompletely specified functions. Examples of full adders and 2's complement adders are also presented.

Uploaded by

Nashit Ahmed Barq
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 18

Lecture 4

Minterm and Maxterm

Conversion of English
sentences to Boolean equations.
• Example
– The alarm will ring iff the alarm
switch is on and the door is not
closed or it is after 6 PM and the
window is not closed.
– Boolean equation
• Z = AB’ + CD’
• If Z = 1 , the alarm will ring.
• Draw the network. Z will drive the
alarm.

Chap 4 C-H1
Combinational Network
Using a Truth Table
• Problem statement
Input 3 bits A, B, C = Binary
number N. Output f. Output f = 1
if N >= 011 and f = 0 if N < 011.
ABC f

000 0
001 0
010 0
011 1
100 1
101 1
110 1
111 1

Chap 4 C-H2
Derive Algebraic
Expression from Truth
Table
• Using f = 1gives the SOP form.

f = A’BC +AB’C’ + AB’C + ABC’ +


ABC
= A’BC + AB’ +AB = A’BC + A
= A + BC.

• Using f = 0 gives the POS form.


Maxterms are multiplied together so that if any one
of them is 0, f will be 0. See what happens if uses
OR.

f = (A+B+C)(A+B+C’)(A+B’+C)
= (A+B)(A+B’+C) = A+BC

Chap 4 C-H3
Minterm and Maxterm
 Minterm
– A minterm of n variables = product of n
literals in which each variable appears
exactly once either in T or F form, but
not in both. (Also known as a standard
product term)
– Each minterm has value 1 for exactly
one combination of values of variables.
E.g. ABC (111) => m7
– A function can be written as a sum of
minterms, which is referred to as a
minterm expansion or a standard sum
of products.

Chap 4 C-H4
Minterm/Maxterm

 Three variables

Chap 4 C-H5
Minterm Notation

 f = A’BC + AB’C’ + AB’C + ABC’


+ABC;
The other way to represent f is:
f (A,B,C) = m3 + m4 + m5 + m6 + m7
or
f (A,B,C) = m(3,4,5,6,7)
Another view,
f (A,B,C) =0.m0+ 0.m1 +0.m2+ 1. m3
+1. m4 +1. m5 +1. m6 +1. m7

 Minterms present in f correspond


with the 1’s of f in the truth table.

Chap 4 C-H6
Maxterm

• Maxterm
– A maxterm of n variables = sum of n
literals in which each variable appears
exactly once in T or F from, but not in
both.
– Each maxterm has a value of 0 for
exactly one combination of values of
variables. E. g. A + B + C’ (001) => M1
(the value is 0). Therefore Mi = m’i.
– A function can be written as a product
of maxterms, which is referred to as a
maxterm expansion or a standard
product of sums.

Chap 4 C-H7
Maxterm Notation

f = (A+B+C)(A+B+C’)(A+B’+C)
f (A,B,C) = M0M1M2 or
f (A,B,C) =  M (0,1,2)

Maxterms present in f
correspond with the 0’s of f in
the truth table.

Chap 4 C-H8
M and m Relationship

• If the minterm expansion for f


(A,B,C) = m3 + m4 + m5 + m6 +
m7 , what is the maxterm
expansion for f(A,B,C)?

Choose those not present in the


minterms.
– So the Maxterm expansion for
f(A,B,C) = M0M1M2.

Chap 4 C-H9
Complement of minterm

• Complement of a minterm is the


corresponding maxterm.
• Example
if f = f (A,B,C) = m3 + m4 + m5
+ m 6 + m7
f’ = (m3 + m4 + m5 + m6 + m7)’
= m’3 m’4 m’5 m’6 m’7
= M3 M4 M5M6M7

Chap 4 C-H10
Find the Minterm
Expansion

f(a,b,c,d) = a’(b’+d) + acd’.


= a’b’ +a’d + acd’
= a’b’(c+c’)(d+d’) +
a’d(b+b’)(c+c’) + acd’(b+b’)
= a’b’c’d’ + a’b’c’d + a’b’cd’
+a’b’cd + a’bc’d + a’bcd + abcd’
+ab’cd’
= Σm(0,1,2,3,5,7,10,14)
What is the maxterm expansion
for f?

Chap 4 C-H11
Find the Maxterm
Expansion
• f(a,b,c,d) = a’(b’+d) + acd’.
= (a’+cd’)(a +b’+d); Use
(x+y)(x’+z)=xz +x’y.
= (a’+c)(a’+d’)(a+b’+d); Use
(x+y)(x+z) = x+yz.
=(a’+bb’+c+dd’)(a’+bb’+cc’+d’)(a+b’
+cc’+d)
=(a’+bb’+c+d)(a’+bb’+c+d’)(a’+bb’+
c+d’)(a’+bb’+c’+d’)(a+b’+cc’+d)
=(a’+b+c+d)(a’+b’+c+d)(a’+b+c+d’)(
a’+b’+c+d’)(a’+b+c’+d’)(a’+b’+c’+
d’)(a+b’+c+d)(a+b’+c’+d)
=ΠM(4,6,8,9,11,12,13,15);
primed = 1, unprimed = 0.
Note that maxterm = 0.

Chap 4 C-H12
General Expressions

• n variables (i = 0 to 2n-1values)
Minterm : F =Σaimi
If ai = 1, then minterm mi exists.

Maxterm : F =Π(ai+Mi);
If ai = 1, then the maxterm does
not exist.

Note that Σaimi = Π(ai+Mi)


F’ = [Π(ai+Mi)]’= Σai’Mi’ =
Σai’mi = Π(ai’+Mi)

Chap 4 C-H13
Incompletely Specified
Functions
• Don’t care terms.
– A’B’C and ABC’ are “don’t care” term.
We don’t care the value of these
terms,whether it is 1 or 0.
 Example
F= A’B’C’+A’BC +ABC = A’B’C’ + BC
(assign 0 to both X’s)
F = A’B’C’+A’B’C+A’BC+ABC =
A’B’+BC (assign 1 to first X and 0 to the
second)
F = A’B’+BC+AB (assign 1 to both X’s).

Chap 4 C-H14
Minterm Expansion for
Don’t Care
• Example
– Minterm
• F = Σm(0,3,7) + Σd(1,6)
– Maxterm
• F = ΠM(2,4,5) . ΠD(1,6)

Chap 4 C-H15
Examples

• 1’s complement adder

Chap 4 C-H16
Full Adder
• One bit

Chap 4 C-H17
2’s Complement Adder

• Form 2’s complement for minus


operand for subtraction

Chap 4 C-H18

You might also like