0% found this document useful (0 votes)

3 views40 pages

Nmu Lecture 06

Uploaded by

Ahmed Mohamed

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

0% found this document useful (0 votes)

3 views40 pages

Nmu Lecture 06

Uploaded by

Ahmed Mohamed

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/ 40

Lecture 06

Karnaugh Maps
Part-2
Prof. Mohammed Alrahmawy

Adapted from slides by:

➔ José Nelson Amaral
➔
Minimum Sum-of-Products

The minimum sum-of-products of a function F is

formed by some, but not necessarily all, of the
prime implicants of the function.
Write all the prime implicants
A for the function g expressed
as this Karnaugh Map.
Example: 1 1
AB
1 1 AD’
D
1 1 1 BD
C AC
1 1

B
2
Minimum Sum-of-products

The minimum sum-of-products of a function F is

formed by some, but not necessarily all, of the
prime implicants of the function.
Now write the minimum
A sum-of-products of g.

Example: 1 1
AB
1 1 AD’
D g = AC + AD’ + BD
1 1 1 BD
C AC
1 1

B
3
Karnaugh Maps of Product-of-sums

Find the minimum sum-of-minterms form for the

following function

F = (b + c + d’)(a + b’ + d)(a’ + b + d’)(a’ + b’ + c’)

Because F is given as a product-of-sums, it is easier to

build the Karnaugh map for F’ and then complement it.
F’ = [(b + c + d’)(a + b’ + d)(a’ + b + d’)(a’ + b’ + c’)]’
= (b + c + d’)’ + (a + b’ + d)’ + (a’ + b + d’)’ + (a’ + b’ + c’)’
= b’c’d + a’bd’ + ab’d + abc

4
Karnaugh Maps of Product-of-sums

F = (b + c + d’)(a + b’ + d)(a’ + b + d’)(a’ + b’ + c’)

F’ = b’c’d + a’bd’ + ab’d + abc

Now we can easily build the Karnaugh map for F’.

d
c

b
5
Karnaugh Maps of Product-of-sums

F = (b + c + d’)(a + b’ + d)(a’ + b + d’)(a’ + b’ + c’)

F’ = b’c’d + a’bd’ + ab’d + abc

Now we can easily build the Karnaugh map for F’.

1 1
d
c

b
6
Karnaugh Maps of Product-of-sums

F = (b + c + d’)(a + b’ + d)(a’ + b + d’)(a’ + b’ + c’)

F’ = b’c’d + a’bd’ + ab’d + abc

Now we can easily build the Karnaugh map for F’.

1
1 1
d
c
1

b
7
Karnaugh Maps of Product-of-sums
F = (b + c + d’)(a + b’ + d)(a’ + b + d’)(a’ + b’ + c’)

F’ = b’c’d + a’bd’ + ab’d + abc

Now we can easily build the Karnaugh map for F’.

1
1 1
d
1
c
1

b
8
Karnaugh Maps of Product-of-sums

F = (b + c + d’)(a + b’ + d)(a’ + b + d’)(a’ + b’ + c’)

F’ = b’c’d + a’bd’ + ab’d + abc

Now we can easily build the Karnaugh map for F’.

1
1 1
d
1 1
c
1 1

b
9
Karnaugh Maps of Product-of-sums
F = (b + c + d’)(a + b’ + d)(a’ + b + d’)(a’ + b’ + c’)

F’ = b’c’d + a’bd’ + ab’d + abc

Now we can easily build the Karnaugh map for F’.
a a

1 1 1 1
1 1 1 1
d d
1 1 1 1
c c
1 1 1 1

b b
F’ F

10
Karnaugh Maps of Product-of-sums
F = (b + c + d’)(a + b’ + d)(a’ + b + d’)(a’ + b’ + c’)

F’ = b’c’d + a’bd’ + ab’d + abc

What is the set of prime implicants of F?

a
b’d’
1 1 1
1 1
d
1 1
c
1 1

b
F
11
Karnaugh Maps of Product-of-sums
F = (b + c + d’)(a + b’ + d)(a’ + b + d’)(a’ + b’ + c’)

F’ = b’c’d + a’bd’ + ab’d + abc

What is the set of prime implicants of F?

a
b’d’
1 1 1 a’cb’

1 1
d
1 1
c
1 1

b
F
12
Karnaugh Maps of Product-of-sums
F = (b + c + d’)(a + b’ + d)(a’ + b + d’)(a’ + b’ + c’)

F’ = b’c’d + a’bd’ + ab’d + abc

What is the set of prime implicants of F?

a
b’d’
1 1 1 a’cb’
a’cd
1 1
d
1 1
c
1 1

b
F
13
Karnaugh Maps of Product-of-sums
F = (b + c + d’)(a + b’ + d)(a’ + b + d’)(a’ + b’ + c’)

F’ = b’c’d + a’bd’ + ab’d + abc

What is the set of prime implicants of F?

a
b’d’
1 1 1 a’cb’
a’cd
1 1 a’bd
d
1 1
c
1 1

b
F
14
Karnaugh Maps of Product-of-sums
F = (b + c + d’)(a + b’ + d)(a’ + b + d’)(a’ + b’ + c’)

F’ = b’c’d + a’bd’ + ab’d + abc

What is the set of prime implicants of F?

a
b’d’
1 1 1 a’cb’
a’cd
1 1 a’bd
d bc’d
1 1
c
1 1

b
F
15
Karnaugh Maps of Product-of-sums
F = (b + c + d’)(a + b’ + d)(a’ + b + d’)(a’ + b’ + c’)

F’ = b’c’d + a’bd’ + ab’d + abc

What is the set of prime implicants of F?

a
b’d’
1 1 1 a’cb’
a’cd
1 1 a’bd
d bc’d
1 1 abc’
c
1 1

b
F
16
Karnaugh Maps of Product-of-sums
F = (b + c + d’)(a + b’ + d)(a’ + b + d’)(a’ + b’ + c’)

F’ = b’c’d + a’bd’ + ab’d + abc

What is the set of prime implicants of F?

a
b’d’
a’cb’ Which prime implicants
1 1 1
a’cd are essential for F?
1 1 a’bd
d bc’d
1 1 abc’
c
1 1 ac’d’

b
F
17
Karnaugh Maps of Product-of-sums
F = (b + c + d’)(a + b’ + d)(a’ + b + d’)(a’ + b’ + c’)

F’ = b’c’d + a’bd’ + ab’d + abc

What is the set of prime implicants of F?

a
b’d’
a’cb’ Which prime implicants
1 1 1
a’cd are essential for F?
1 1 a’bd
d bc’d Only b’d’ is essential.
1 1 abc’
c
1 1 ac’d’
Does the set of all
essential prime implicants
b
completely define F?
F
18
Karnaugh Maps of Product-of-sums
F = (b + c + d’)(a + b’ + d)(a’ + b + d’)(a’ + b’ + c’)

F’ = b’c’d + a’bd’ + ab’d + abc

Now we can write the minimized form for F.

1 1 1
1 1 F = b’d’
d
1 1
c
1 1

b
F
19
Karnaugh Maps of Product-of-sums
F = (b + c + d’)(a + b’ + d)(a’ + b + d’)(a’ + b’ + c’)

F’ = b’c’d + a’bd’ + ab’d + abc

Now we can write the minimized form for F.

1 1 1
1 1 F = b’d’ + a’cd
d
1 1
c
1 1

b
F
20
Karnaugh Maps of Product-of-sums
F = (b + c + d’)(a + b’ + d)(a’ + b + d’)(a’ + b’ + c’)

F’ = b’c’d + a’bd’ + ab’d + abc

Now we can write the minimized form for F.

1 1 1
1 1 F = b’d’ + a’cd + bc’d
d
1 1
c
1 1

b
F
21
Karnaugh Maps of Product-of-sums
F = (b + c + d’)(a + b’ + d)(a’ + b + d’)(a’ + b’ + c’)

F’ = b’c’d + a’bd’ + ab’d + abc

Now we can write the minimized form for F.

1 1 1
1 1 F = b’d’ + a’cd + bc’d + ac’d’
d
1 1
c
1 1

b
F
22
Incompletely Specified Functions
A
w
x B
y
N1 N2 F
C
z

Assumption: N1 never produces the combinations

ABC = 001 and ABC = 110.

Question: What value should F produce for the

combinations ABC = 001 and ABC = 110?
We don’t care!!!
23
Incompletely Specified Functions (Cont.)
How can we use the fact that we don’t care about
the value produced by F when ABC = 001 or
ABC = 110 to simplify the circuit N2?

A B C F If we assume that F(0,0,1) = 0 and

0 0 0 1 F(1,1,0) = 0, we obtain the following equation
0 0 1 X 0
0 1 0 1 F(A,B,C) = A’B’C’ + A’BC’ + A’BC + ABC
0 1 1 1
1 0 0 0 = A’C’(B’ + B) + (A’ + A)BC
1 0 1 0 = A’C’·1 + 1·BC
1 1 0 X0
+
1 1 1 1 = A’C’ + BC

24
Incompletely Specified Functions (Cont.)

However, if we assume that F(0,0,1) = 1 and

F(1,1,0) = 1, we obtain instead the equation:

F(A,B,C) = A’B’C’ + A’B’C + A’BC’ + A’BC + ABC’ + ABC

A B C F = A’B’(C’ + C) + A’B(C’ + C) + AB(C’ + C)
0 0 0 1
0 0 1 X 1 = A’B’ ·1 + A’B ·1 + AB ·1
0 1 0 1 = A’B’ + A’B + AB
0 1 1 1
1 0 0 0 = A’B’ + A’B + A’B + AB
1 0 1 0
1 1 0 X 1 = A’(B’ + B) + (A’ + A)B
+
1 1 1 1 = A’·1 + 1·B
= A’ + B

Compare this with the other solution: F(A,B,C) = A’C’ + BC.

Which one is cheaper to implement?
25
Incompletely Specified Functions
Don’t care values are easily used to simplify
incompletely specified functions.
A

1 X
A B C F
0 0 0 1 B 1 1 1 X
0 0 1 X
0 1 0 1 C
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 X F = A’ + B
+
1 1 1 1

26
Another Example

Write the minimized sum-of-product

expression for F given in this
a Karnaugh map.
1 1 1
1 X
d
1 1 X 1 F = cd
c
X

b
F

27
Another Example

Write the minimized sum-of-product

expression for F given in this
a Karnaugh map.
1 1 1
1 X
d
1 1 X 1 F = cd + b’c’d’
c
X

b
F

28
Another Example

Write the minimized sum-of-product

expression for F given in this
a Karnaugh map.
1 1 1
1 X
d
1 1 X 1 F = cd + b’c’d’ + a’bc’
c
X

b
F

29
5-Variable Karnaugh Maps
BC
DE 00 01 11 10
00 1 1 1 A F=
1 1 1
0
01 1 1 1
1 1
11 1 1
1 1
10 1 1 B B