TOBB ETU

Gate-Level Minimization
Map Method

Pictorial form of Truth Table: Karnaugh Map (K-Map)

Dr. Maurice Karnaugh

Two-Variable Karnaugh Map

xy m3

x+y = x(y+y’) + y(x+x’) = xy+xy’+xy+x’y

= xy+xy’+x’y m3+m2+m1
Three-Variable Karnaugh Map

Any two adjacent squares in the map differ by only one variable

adjacent

adjacent

sum of two minterms in adjacent squares

can be simplified to a single product term
consisting of only two literals.

Ex: m5 + m7 = xy’z + xyz = xz(y’+ y) = xz

Simplify the Boolean function F (x, y, z) = σ (2, 3, 4, 5)

sum of two minterms in adjacent squares can be simplified

to a single product term consisting of only two literals.
 m0 + m2 + m4 + m6
= x’yz’ + x’y’z’ + xy’z’ + xyz’
Simplify the Boolean function F (x, y, z) = σ (3, 4, 6, 7) = x’z’+xz’=z’

F = xz’ + yz

The number of adjacent squares that may be

combined must always represent a number that is
a power of two, such as 1, 2, 4, and 8.
 Important !
- One square represents one minterm, giving a term with three literals.
- Two adjacent squares represent a term with two literals.
- Four adjacent squares represent a term with one literal.
- Eight adjacent squares encompass the entire map and produce a function that is always equal to 1.
Simplify the Boolean function F (x, y, z) = σ (0, 2, 4, 5, 6)

Ex: F=A’C+A’B+AB’C+BC m0 m1 m3 M2
m4 m5 m7 m6
a- Express the function as a sum of minterms
b- Find the minimal sum of products expression with and
w.o Karnaugh Map B

F=A’C(B+B’)+A’B(C+C’)+AB’C+BC(A+A’) 1 1 1
=A’BC+A’B’C+A’BC+A’BC’+AB’C+ABC+A’BC
= 011 001 011 010 101 111 011 A 1 1
= m3 m1 m3 m2 m5 m7 m3
= m1, m2, m3, m5, m7
C C A’B

A’B+C
Four-Variable Karnaugh Map
Four-Variable Karnaugh Map

Simplify the boolean function: F (w, x, y, z) = σ (0, 1, 2, 4, 5, 6, 8, 9, 12, 13, 14)

y’ w’z’
y

1 1 1

1 1 1
x

1 1 1
w
xz’
1 1

z
Four-Variable Karnaugh Map

Simplify the Boolean function, F = A’B’C’+ B’CD’+ A’BCD’+ AB’C’

B’D’
C’B’
C

1 1 1

1
B

D’CA’
A

1 1 1

D
 PRODUCT-OF-SUMS SIMPLIFICATION
Gate Implementation
F (A, B, C, D) = σ (0, 1, 2, 5, 8, 9, 10)
DC

C
BD’

0 0 0
B

0 0 0 0
A

0
AB
D
F’ (A, B, C, D) =BD’+CD+AB
F(A,B,C,D) = (BD’+CD+AB)’
=(B’+D)(C’+D’)(A’+B’)
 DON’T CARE CONDITIONS
Unspecified minterms of a function
to represent conditions that are unimportant due to unused or invalid input combinations.
Simplify the Boolean function F (A, B, C, D) = σ (1, 3, 7, 11, 15)
which has the don’t-care conditions, d (A, B, C, D) = σ (0, 2, 5)
F = A’D+CD A’D
A’B’ F = A’B’+CD
C C

X 1 1 X X 1 1 X

0 X 1 0 0 X 1 0
B B

0 0 1 0 0 0 1 0
A A

0 0 1 0 0 0 1 0
CD
CD
D D
DON’T CARE CONDITIONS

In terms of product of sums:

D’ F’ = AC’+D’ => F=(A’+C)D

C

X 1 1 X

0 X 1 0
B

0 0 1 0
A

0 0 1 0

AC’ D
 NAND CIRCUITS

x x’
Inverter x x’ 1

(xy)’
(xy)’ x
x xy
xy y 1
AND y

x x
(x’y’)’= x+y
1 (x’y’)’= x+y
OR
y y
1
3-Inputs NAND Gates

The implementation of Boolean functions with NAND gates

requires that the functions be in sum-of-products form.

Ex: F = AB + CD
Implement the following Boolean function with NAND gates:

F (x, y, z) = (1, 2, 3, 4, 5, 7)

Implement F = A(CD + B) + BC’ with multi-level NAND Circuits

 NOR CIRCUITS

x x’
x x’ 0
Inverter

x x’
0
x xy
AND xy
y y’
y
0

(x+y)’
x x+y x
OR y y x+y
0
Graphic Symbols for NOR gate Ex: F = (A+B)(C+D)E

A A+B
B
F
C C+D
A two-level implementation with NOR gates requires that D
the function be simplified into product-of-sums form
E

A (A+B)’ (A+B)’
A
B B
C+D F F
C+D
C C
D D
E E
0