Scribd
Upload
4 views15 pages

Chapter 3 Gate-Level Minimization-1-15

The document discusses gate-level minimization in digital logic design, focusing on the optimal implementation of Boolean functions. It introduces the Karnaugh map method for simplifying Boolean expressions, detailing its application for two, three, and four-variable maps with examples. The document emphasizes the importance of minimizing the number of terms and literals in Boolean functions.

Uploaded by

EXPERT TeRmINAtoR
Copyright
© © All Rights Reserved
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
4 views15 pages

Chapter 3 Gate-Level Minimization-1-15

The document discusses gate-level minimization in digital logic design, focusing on the optimal implementation of Boolean functions. It introduces the Karnaugh map method for simplifying Boolean expressions, detailing its application for two, three, and four-variable maps with examples. The document emphasizes the importance of minimizing the number of terms and literals in Boolean functions.

Uploaded by

EXPERT TeRmINAtoR
Copyright
© © All Rights Reserved
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/ 15

Digital Logic Design I

Gate-Level Minimization

March 9, 2025 EASTERN MEDITERRANEAN UNIVERSITY 1


3-1 Introduction
 Gate-level minimization refers to the design task of
finding an optimal gate-level implementation of Boolean
functions describing a digital circuit.

March 9, 2025
2
3-2 The Map Method
 The complexity of the digital logic gates
 The complexity of the algebraic expression
 Logic minimization
 Algebraic approaches: 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

March 9, 2025
3
Review of Boolean Function
 Boolean function
 Sum of minterms
 Sum of products (or product of sum) in the simplest form
 A minimum number of terms
 A minimum number of literals
 The simplified expression may not be unique

March 9, 2025
4
Two-Variable Map
 A two-variable map
 Four minterms
 x' = row 0; x = row 1
 y' = column 0; y =
column 1
 A truth table in square
diagram
 Fig. 3.2(a): xy = m3 Figure 3.1 Two-variable Map
 Fig. 3.2(b): x+y =
x'y+xy' +xy =
m1+m2+m3

Figure 3.2 Representation of functions in the map


March 9, 2025
5
A 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., m5 and m7 can be simplified
 m5+ m7 = xy'z + xyz = xz (y'+y) = xz

March 9, 2025
Figure 3.3 Three-variable Map
6
A 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'

March 9, 2025
7
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'

March 9, 2025
8
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'


March 9, 2025
9
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

March 9, 2025
Figure 3.3 Three-variable Map
10
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'
March 9, 2025
11
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.
Ans:
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
March 9, 2025
12
3.3 Four-Variable Map
 The map
 16 minterms
 Combinations of 2, 4, 8, and 16 adjacent squares

March 9, 2025 Figure 3.8 Four-variable Map 13


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'
March 9, 2025
14
Example 3.6
 Example 3-6: simplify F = ABC + BCD + ABCD +
ABC

Figure 3.9 Map for Example 3-6; ABC + BCD + ABCD


+ ABC= BD + BC +ACD

March 9, 2025
15

You might also like