DIGITAL
ELECTRONICS
(MODULE-III)
CHAPTER:03
Gate-Level Minimization
3-1 INTRODUCTION
Gate-level minimization refers to the
design task of finding an optimal (best
possible) gate-level implementation of
Boolean functions describing a digital
circuit.
3-2THE MAP METHOD
The complexity of the digital logic gates
The complexity of the algebraic expression
Logic minimization
Algebraicapproaches: lack specific rules
The Karnaugh map
A simple straight forward procedure
A pictorial form of a truth table
Applicable if the # of variables < 7
A diagram made up of squares
Each square represents one minterm
TWO-VARIABLE MAP
A two-variable
map
Four minterms
x' = row 0; x =
row 1
y' = column 0; y Figure 3.1 Two-variable Map
= column 1
A truth table in
square diagram
Fig. 3.2(a): xy =
m3
Fig. 3.2(b): x+y =
x'y+xy' +xy = Figure 3.2 Representation of functions in the map
m +m +m
THREE-VARIABLE MAP
A three-variable map
Eight minterms
The Gray code sequence
Any two adjacent squares in the map differ by only
on variable
Primed in one square and unprimed in the other
e.g., m and m can be simplified
5 7
m5+ m7 = xy'z + xyz = xz (y'+y) = xz
Figure 3.3 Three-variable Map
THREE-VARIABLE MAP
m0 and m2 (m4 and m6) are adjacent
m0 + m2 = x'y'z' + x'yz' = x'z' (y'+y) = x'z'
m4 + m6 = xy'z' + xyz' = xz' (y'+y) = xz'
EXAMPLE 3.1
Example 3.1: simplify the Boolean
function F(x, y, z) = S(2, 3, 4, 5)
F(x, y, z) = S(2, 3, 4, 5) = x'y + xy'
Figure 3.4 Map for Example 3.1, F(x, y, z) = Σ(2, 3, 4, 5) = x'y + xy'
EXAMPLE 3.2
Example 3.2: simplify F(x, y, z) = S(3, 4,
6, 7)
F(x, y, z) = S(3, 4, 6, 7) = yz+ xz'
Figure 3.5 Map for Example 3-2; F(x, y, z) = Σ(3, 4, 6, 7) = yz + xz'
FOUR ADJACENT SQUARES
Consider four adjacent squares
2, 4, and 8 squares
m0+m2+m4+m6 = x'y'z'+x'yz'+xy'z'+xyz' =
x'z'(y'+y) +xz'(y'+y) = x'z' + xz' = z'
m1+m3+m5+m7 = x'y'z+x'yz+xy'z+xyz
=x'z(y'+y) + xz(y'+y) =x'z + xz = z
Figure 3.3 Three-variable Map
EXAMPLE 3.3
Example 3.3:Simplify F(x, y, z) = S(0, 2, 4, 5,
6)
F(x, y, z) = S(0, 2, 4, 5, 6) = z'+ xy'
Figure 3.6 Map for Example 3-3, F(x, y, z) = Σ(0, 2, 4, 5, 6) = z' +xy'
EXAMPLE 3.4
Example 3.4: let F = A'C + A'B + AB'C +
BC
a) Express it in sum of minterms.
b) Find the minimal sum of products
expression.
F(A, B, C) = S(1, 2, 3, 5, 7) = C + A'B
Figure 3.7 Map for Example 3.4, A'C + A'B + AB'C + BC = C + A'B
3.3 FOUR-VARIABLE MAP
The map
16 minterms
Combinations of 2, 4, 8, and 16 adjacent
squares
Figure 3.8 Four-variable Map
EXAMPLE 3.5
Example 3.5: simplify F(w, x, y, z) = S(0,
1, 2, 4, 5, 6, 8, 9, 12, 13, 14)
F = y'+w'z'+xz'
Figure 3.9 Map for Example 3-5; F(w, x, y, z) = Σ(0, 1, 2, 4, 5, 6, 8, 9, 12, 13, 14) = y' + w' z' +xz'
EXAMPLE 3.6
Example 3-6: simplify F = ABC +
BCD + ABCD + ABC
Figure 3.9 Map for Example 3-6; ABC + BCD +
ABCD + ABC= BD + BC +ACD
