Gate Level Minimization

And
K - Map
 Introduction
• Map Method
• Definition of Map
• Need of Map
• Advantages
Two variable map
y
y 0 1
x
m0 m1 x`y` x`y
0
m2 m3 x 1 x y` xy

F(x,y) = ∑(1,2,3)
F(x,y) = m1+m2+m3
F(x,y) = x`y + x y` + x y
Three variable Map
yz y
x 00 01 11 10
m m1 m3 m2
0 0

x m4 m5 m7 m6
1

x`y`z` x`y`z x`y z x`y z`

x y`z` x y`z xyz xyz`

 F(x,y,z) =∑ (2,3,4,5)
m0 m1 m3 m2

m4 m5 m7 m6

yz
yz
00 01 11 00 01 11 10
10
x x
0 1 1 0 1 1

1 1 1 1 1
1
F(x,y,z) = ∑ (2,3,4,5)
= m2 +m3 + m4 + m5
m2 + m3 = x`y z` + x`y z
= x`y(z` + z) = x`y
m4 + m5 = x y`z` + x y` z
= x y`(z +z`) = x y`
F(x,y,z) = x`y + x y`
 yz F( x,y,z) = ∑ (1,2,3,5,7)
00 01 11 10
x 1 1 1
0

1 1 1

y
yz
00 01 11 10
x
1 1 1
0

1 1
x 1

z
 •Points to remember
•One square represents one minterm,giving a
term of three literals.
•Two adjacent squares represent a term of
two literals.
•Four adjacent squares represent a term of
one literal.
•Eight adjacent squares represent the
function equal to one
F( x,y,z) = ∑ (1,2,3,5,7)
= m1 + m2 + m3+ m5 +m7
From four adjacent squares
m1+m3+m5+m7 = x`y`z +x`y z + x y`z + xyz
= x`z + x z
=z
From two adjacent square
m2 + m3 = x`y z + x`y z`
= x`y
Simplified Expression
F(x,y,z) = z + x`y
•One square represents one minterms
•Two adjacent squares represent a term of
three literals.
•Four adjacent squares represent a term of
two literals.
•Eight adjacent squares represent a term of
one literal.
•Sixteen adjacent squares represent the
function equal to 1
Four variable Map

m0 m1 m3 m2

m4 m5 m7 m6

m12 m13 m15 m14

m8 m9 m11 m10
Simplify the Boolean function
F(A,B,C,D) = ∑(0,1,2,4,5,6,8,9,12,13,14)
 CD C

AB

B
1
A

D
From eight adjacent squares give one literal
mo ,m1, m4,m5,m12,m13,m8,9 = C`

Four squares give two literals

m0,m4,m2,m6 = A`D`
m4,m12,m6,m14 = B D`

Simplified equation
F(A,B,C,D) = C` + A`D` + B D`
Prime Implicants
A prime implicant is a product term obtained
by combining the maximum possible number
of adjacent square in the map.

Essential prime Implicant

If a minterm in a square is covered by only
one prime implicant, that prime implicant is
called essential prime implicant
Prime Implicants

F = BD+`BD`+CD+AD
F= BD+B`D`+CD+AB`
F=BD+B`D`+B`C+AD
F=BD+B`D`+B`C+AB`
Essential Prime Implicants

Essential Prime Implicants BD And B`D`

Points to remember
•Single 1 on a map represents a prime
implicant if it is not adjacent to any other 1’s.
•Two adjacent 1’s form a prime implicant,
provided that they are not with a group of
four adjacent squares.
•Four adjacent 1’s form a prime implicants if
they are not with in a group of eight adjacent
squares
Simplify the following Boolean functions using
K-maps:
• F(x,y,z) = ∑(2,3,6,7)
• F(A,B,C,D) = ∑(0,2,4,5,6,7,8,10,13,15)
• F = wxy + yz +x y`z + x` y.
• Find all the prime implicants for the following
boolean functions, and determine which are
essential;
a) F(w,x,y,z) = ∑(1,3,4,5,10,11,12,13,14,15)
b) F(A,B,C,D) = ∑(0,2,3,5,7,8,10,11,14,15)