Scribd
Upload
9 views18 pages

Lecture Note 3

Chapter 3 discusses gate-level minimization, focusing on the use of computer-based logic synthesis tools for optimizing Boolean functions in digital circuits. It introduces the Karnaugh map (K-map) method as a visual approach for minimizing Boolean expressions, applicable for functions with fewer than seven variables. The chapter includes examples and exercises to illustrate the simplification of Boolean functions using K-maps.

Uploaded by

nedmacuacua88
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
9 views18 pages

Lecture Note 3

Chapter 3 discusses gate-level minimization, focusing on the use of computer-based logic synthesis tools for optimizing Boolean functions in digital circuits. It introduces the Karnaugh map (K-map) method as a visual approach for minimizing Boolean expressions, applicable for functions with fewer than seven variables. The chapter includes examples and exercises to illustrate the simplification of Boolean functions using K-maps.

Uploaded by

nedmacuacua88
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/ 18

CHAPTER 3

Gate-Level Minimization
3:1

Introduction
Introduction
• Gate-level minimization is the design task of finding an optimal
gate-level implementation of the Boolean functions describing a
digital circuit.

• This is difficult to execute by manual methods when the logic


has more than a few inputs. Fortunately, computer-based logic
synthesis tools can minimize a large set of Boolean equations
efficiently and quickly
3:2

The Map Method


The Map Method
• The complexity of the digital logic gates that implement a Boolean
function is directly related to the complexity of the algebraic expression
from which the function is implemented.
• Although the truth table representation of a function is unique, when
it is expressed algebraically it can appear in many different, but
equivalent, forms.

• Boolean expressions may be simplified by algebraic means however, this


procedure of minimization is awkward because it lacks specific rules to
predict each succeeding step in the manipulative process.
• The map method presented here provides a simple, straightforward
procedure for minimizing Boolean functions. This method may be
regarded as a pictorial form of a truth table. The map method is also
known as the Karnaugh map or K-map .
The Map Method
• 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
• The simplified expression produced by the map are always in one
of the two standard forms:
• Sum of products
• Product of sums
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
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


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

Figure 3.3 Three-variable Map


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'
Examples
• 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'
Examples
• 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 in the three-variable map.
• Any such combination represents the logical sum of four minterms
and results in an expression of only one literal.
• The number of adjacent squares that may be combined – power of
two – 1,2,4 and 8.
• Larger number of adjacent squares – Product term with fewer
literal
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
Examples
• 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'
Examples
• 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
Exercises
• Simplify the following Boolean functions, using three-variable
maps:
• F1(x, y, z) = S (0, 2, 4, 6)
• F1(x, y, z) = S ( 0, 2, 4, 5, 6, 72)
• F1(x, y, z) = S ( 0, 1, 2, 3, 4, 62)
• F1(x, y, z) = S ( 1, 4, 5, 7)
• Simplify the following Boolean expressions, using three-variable
maps:
• F(x, y, z) = xyz + xy + xyz
• F(x, y, z) = xyz + xyz + xyz + xyz + xyz
• F(x, y, z) = xyz + xz
• F(x, y, z) = xyz + xy + xyz + xyz
Thanks for listening!

You might also like