Scribd
Upload
16 views15 pages

DSD Lecture 12

Uploaded by

Mr.K Sanath Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
16 views15 pages

DSD Lecture 12

Uploaded by

Mr.K Sanath Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 15

DIGITAL SYSTEM DESIGN

(EC303PC)
LECTURE-12:Simplification of Boolean
Functions

Dept. of ECE, GNIT


Minterms and Maxterms
• Each individual term in standard SOP form is
called minterm and each individual term in
standard POS form is called maxterm.
• This concept allows us to introduce a
convenient shorthand notation to express
logical functions.
Purpose of the Index
• Minterms and Maxterms are designated with an index
• The index number corresponds to a binary pattern
• The index for the minterm or maxterm, expressed as a
binary number, is used to determine whether the variable is
shown in the true or complemented form
• For Minterms:
– „1‟ means the variable is “Not Complemented” and
– „0‟ means the variable is “Complemented”.
• For Maxterms:
– „0‟ means the variable is “Not Complemented” and
– „1‟ means the variable is “Complemented”.
Minterms
• Minterms are AND terms with every
variable present in either true or
complemented form.
• Given that each binary variable may appear
normal (e.g., A) or complemented (e.g., A ), there
are 2n minterms for n variables.
• Example: Two variables (A and B)
produce 2 x 2 = 4 combinations:
AB (both normal)
AB (A normal, B complemented)
AB (A complemented, B normal)
AB (both complemented)
• Thus there are four minterms of two variables.
Maxterms
• Maxterms are OR terms with every variable in true
or complemented form.
• Given that each binary variable may appear
normal (e.g., A) or complemented (e.g., A), there
are 2n maxterms for n variables.
• Example: Two variables (A and B)
produce 2 x 2 = 4 combinations:
A+B (both normal)
A+B (A normal, B
complemented) A+B (A complemented,
B normal) A+B (both complemented)
Minterms & Maxterms for 2 variables
• Two variable minterms and maxterms.
A B Index Minterm Maxterm
0 0 0 m0 = A B M0 = A + B
0 1 1 m1 = A B M1 = A + B
1 0 2 m2 = A B M2 = A + B
1 1 3 m3 = A B M3 = A + B
• The minterm mi should evaluate to 1 for each
combination of A and B.
• The maxterm is the complement of the minterm
Table below gives the minterms and maxterms for
three literal logical function
With the short hand notations shown in the
table , logical functions can be represented as:
Sum-Of-Products(Minterms)
• Sum-Of-Products (SOP) canonical form:
Sum of minterms of entries that evaluate to „1‟
A B C F Minterm
0 0 0 0
0 0 1 1 m1 = A B C
0 1 0 0 Focus on the
0 1 1 0 „1‟ entries
1 0 0 0
1 0 1 0
1 1 0 1 m6 = A B C
1 1 1 1 m7 =A B C

F = m1 + m6 + m7 = ∑ (1, 6, 7) =A B C + A B C + A B C
Sum-Of-Products (Minterms)
Examples
• F(a, b, c, d) = ∑(2, 3, 6, 10, 11)
• F(a, b, c, d) = m2 + m3 + m6 + m10 + m11
abcd+abcd+abcd+abcd+abcd
• G(a, b, c, d) = ∑(0, 1, 12, 15)
• G(a, b, c, d) = m0 + m1 + m12 + m15
abcd+abcd+abcd+abcd
Product-Of-Sums (Maxterm)(POS)
• Product-Of- Sums (Maxterm) (POS) canonical form:
Product of maxterms of entries that evaluate to „0‟
A B C F Maxterm
0 0 0 1
0 0 1 1
0 1 0 0 M2 = (A + B + C) Focus on the
0 1 1 1 „0‟ entries
1 0 0 0 M4 = (A + B + C)
1 0 1 1
1 1 0 0 M6 = (A + B + C)
1 1 1 1

F = M2·M4·M6 = ∏ (2, 4, 6) = (A+B+C) (A+B+C) (A+B+C)


Product-Of-Sums (Maxterm) Examples

• F(a, b, c, d) = ∏(1, 3, 6, 11)


• F(a, b, c, d) = M1 · M3 · M6 · M11
(a+b+c+d) (a+b+c+d) (a+b+c+d) (a+b+c+d)
• G(a, b, c, d) = ∏(0, 4, 12, 15)
• G(a, b, c, d) = M0 · M4 · M12 · M15
(a+b+c+d) (a+b+c+d) (a+b+c+d) (a+b+c+d)
Conversions Between Canonical Forms
x y z F Minterm Maxterm
0 0 0 0 M0 = (x + y + z)
0 0 1 1 m1 = x y z
0 1 0 1 m2 = x y z
0 1 1 1 m3 = x y z
1 0 0 0 M4 = (x + y + z)
1 0 1 1 m5 = x y z
1 1 0 0 M6 = (x + y + z)
1 1 1 1 m7 = x y z

F = m1+m2+m3+m5+m7 = ∑(1, 2, 3, 5, 7) =
xyz+xyz+xyz+xyz+xyz
F = M0 · M4 · M6 = ∏(0, 4, 6) = (x+y+z)(x+y+z)(x+y+z)
Function Complements
• The complement of a function expressed as a
sum of minterms is constructed by selecting the
minterms missing in the sum-of-minterms
canonical form
• Alternatively, the complement of a function
expressed by a Sum of Minterms form is
simply the Product of Maxterms with the same
indices
• Example: Given F(x, y, z) = ∑ (1, 3, 5, 7)
F(x, y, z) = ∑ (0, 2, 4, 6)
F(x, y, z) = ∏ (1, 3, 5, 7)
Summary of Minterms and Maxterms
• There are 2n minterms and maxterms for Boolean
functions with n variables.
• Minterms and Maxterms are indexed from 0 to 2n – 1
• Any Boolean function can be expressed as a logical
sum of minterms and as a logical product of
maxterms
• The complement of a function contains those
minterms not included in the original function
• The complement of a sum-of-minterms is a product-
of- maxterms with the same indices

You might also like