Minimization Techniques

Need for Minimization

• Digital logic circuit  collection of logic gates, input

signals that drive them and output signals they produce
• The behavioral requirements of a logic circuit are best
expressed through truth tables(unique) or logic
equations(Different forms)
• Any design problem that can be addressed with a logic
circuit can be expressed in one of these forms.
• Both of these forms define: behavior of a logic circuit,
how inputs are combined to drive outputs. But they do
not specify how to build a circuit that meets these
requirement
2
 Need for Minimization
• Design task of finding an optimal gate-level implementation of
the Boolean functions describing a digital circuit  Gate Level
minimization
• Implementation of Boolean expression is directly related to
the complexity of the algebraic expression
Simplification of Boolean function
• Finding an equivalent expression with minimum number of
literals and gates
• For a simple function, it is possible to obtain a simple
expression for low cost implementation
• But, with complex functions, it is a very difficult task
• Manual methods are cumbersome when there are large
number of inputs
• Computer based logic synthesis tools are used for
minimization
3
 Methods of Minimization
 Boolean Algebra
 Map Method
 Algebraic method – by applying rules and laws of Boolean algebra
 Procedure of minimization is difficult because it lacks specific rules to predict
each succeeding step in the manipulative process.
 It is difficult to determine whether the simplest form has been achieved.
 Karnaugh Map (K-map) is a simple procedure for simplifying Boolean
expressions
• A Graphical representation of Boolean Truth
expression to simplify logic expressions Table
Simplified
• The map method is known as Karnaugh K-Map Boolean
Map or K-Map or Veitch diagram Boolean Function
function
• Gives the simplest form of an
expression is the one that has the Produces a circuit diagram with the
minimum number of terms with the minimum number of gates and
least number of literals (variables) in minimum number of inputs to the gate
each term. 4
 Map Method
• Complexity of the digital logic gates that implement a
Boolean function depends on the complexity of the
algebraic expression
• Algebraic representation of truth table – multiple
equivalent solutions
• Map method (K-Map, Karnaugh map) provides a simple,
straight forward procedure for minimizing Boolean
function
• Map – pictorial representation of truth table in terms of
squares, each square representing minterms of the
function to be minimized
• Final solution: simplified SOP/POS with minimum number
of terms and minimum number of literals
5
 Two Variable Map
• Number of variables: 2
• Number of minterms: 4  4 squares in the map
• Map represents relationship between x and y
• x appears in primed row 0 and unprimed row 1
• y appears in primed column 0 and unprimed column 1

6
 Two Variable Map
F = xy

Z=x+y
y is varying, x is constant

=x
1
x is varying, y is constant

1 1 =y
Z = x’y + xy’ + xy Z=x+y 7
 Three Variable Map
3 Variables 8 minterms 8 squares

Sequence: Gray Code

Any two adjacent

squares in the
map differ by
only one variable

m0 + m1
= x’y’z’ + x’y’z
= x’y’(z’+z)
= x’y’

sum of two minterm in

adjacent squares can be one bit changes in value
Each variable appears: from one row to the next
• Primed in 4 squares simplified to a single AND
• Unprimed 4 squares term consisting of only two
8
literals
 Karnaugh map rules
K-Map uses the following rules for the simplification of Boolean expressions by
grouping together adjacent squares(cells) containing ones.

Rule 1
Group may not include any square containing a zero.

 Wrong  Correct

Rule 2
Group may be horizontal or vertical , but not in diagonal direction

 Wrong
 Correct
9
 Karnaugh map rules
Rule 3
Groups must contain 1,2 4,8 …. In general 2n squares ie if n=1,group should
contain 21=2 ones , For n=2 , no of ones in the group should be 22=4 etc.

 Correct

Group of 2 Group of 4

 Wrong

Group of 3 Group of 5
 Karnaugh map rules
Rule 4
Each group should be as large as possible.

 Correct
Even no Boolean law broken , minimal
expression is not formed
𝑌 = 𝐴 𝐵 + 𝐴 𝐵 + A𝐵 𝑌 =𝐴+𝐵

Rule 5
Each group containing a one must be at least in one group.

11
 Karnaugh map rules
Rule 6
Groups may be overlapped.

Overlapping of groups might be given minimal expression

Rule 7
Groups may wrap around the table .
The leftmost squares in a row may be grouped with the rightmost squares and top squares in
a column may be grouped with the bottom squares.

12
 Karnaugh map rules
Rule 8
The map should contain as few groups as possible which covers all the minterms
/ones of the function.

Summary:
No zeros covered
No diagonals formation of groups
Number of squares in each group should be in powers of 2
Groups should be as large as possible
Every ‘one’ must be covered in atleast one group
Overlapping of groups are allowed
Wrap around the squares allowed
Form the Smallest number of groups as possible as.
13
Example
• F(x, y) = Σ m(0,3) Look for 2n combination

1
F = x’y’ + xy
1

• F(x, y) = Σ m(0,2)
𝐹 = 𝑥 ′ 𝑦 ′ + 𝑥𝑦 ′ = 𝑦 ′ 𝑥 ′ + 𝑥 = 𝑦′

𝐹 = 𝑦′

14
Example
• F(x, y, z) = Σ m(2,3,4,5)

1 1

1 1

F= x’yz’ +x’yz + xy’z’ + xy’z

x’yz + x’yz’ = x’y(z+z’) = x’y

F = x’y + xy’
xy’z’ + xy’z = xy’(z+z’) = xy’
15
Example
• Reduce the Boolean expression
Y = AB𝐶 + 𝐴𝐵𝐶 + 𝐴𝐵 𝐶
Y = 110 111 001

1 1

𝑌 = 𝐴𝐵 + 𝐴𝐵𝐶

16
Example

F = Σ m(0,1,3,4,5,7)
Higher order 2n combination

1 1 1

1 1 1

F = y’ + z

17
Example

F = Σ m(0,2,3,4,5,6)
Higher order 2n combination

Achieved by rolling the

K map, such a way that
1 1 1 there is one bit change
along the row
1 1 1

F = z’ + xy’ + x’y

18
Given the Boolean Function 𝐹 = 𝐴′ 𝐶 + 𝐴′ 𝐵 + 𝐴𝐵′ 𝐶 + 𝐵𝐶
a) Express it in sum of minterms
b) Find the minimal sum of products expression.

𝑏) 𝐹 = 𝐶 + 𝐴′ 𝐵

𝑎) 𝐹 𝐴, 𝐵, 𝐶 = 𝑚(1,2,3,5,7)

Alternatively, F = A’(B+B’)C+A’B(C+C’)+AB’C+ (A+A’)BC

= A’B’C+A’BC+A’BC’+AB’C+ABC
Alternatively, Form the truth table ,find the minterms of the Boolean expression
19
Example:
Simplification of Product of sums(POS/POM)
• F(x, y, z) = 𝑀(1,2,3,5,7)

Look for 2n combination

x varying between 0 and 1
0 0 0 y varying between 0 and 1
z remains unchanged
0 0 z
x remains unchanged
y remains unchanged
Since minterms were considered z varying between 0 and 1
while reduction
x’y
F’ = x’y + z
F = (x + y’) . z’

20
Example
• Reduce the Boolean expression
Y = (𝐴 + 𝐵 + 𝐶)(𝐴 + 𝐵 + 𝐶 )(𝐴 + 𝐵 + 𝐶)(𝐴 + 𝐵 + 𝐶 )
POM form

Y’ = A’C + BC’

0 0 0
Y = (A+C’)(B’+C)
0

21
 Four Variable Map
4 variables 24=16 minterms 16 squares
• The rows and columns are numbered in
a Gray code sequence, with only one
digit changing value between two
adjacent rows or columns.
• The minterm corresponding to each
square can be obtained from the
concatenation of the row number with
the column number.
• For example, the numbers of the third
row (11) and the fourth column (10),
when concatenated, give the binary
number 1110, the binary equivalent of
decimal 14.
• The square in the third row and fourth
column represents minterm m14.

22
 Four Variable Map
Minimization:
Adjacent squares are defined to be squares next to each other.
In addition, the map is considered to lie on a surface with the top and bottom
edges, as well as the right and left edges, touching each other to form adjacent
squares.
For example, m0 and m8, m1 and m9 etc & m4 and m6 , m12 and m14 etc are
form adjacent squares

Number of Number of literals

Adjacent Squares in a minterm
1 4
2 3
4 2
8 1
16 Logic 1

Combination of adjacent squares  useful in the simplification process

No other combination of squares can simplify the function. 23
 Four Variable Map Examples
Simplify the following Boolean Function
𝐹 𝑤, 𝑥, 𝑦, 𝑧 = (0,1,2,4,5,6,8,9,12,13,14)

24
 Four Variable Map Examples
Simplify the following Boolean Function
𝐹 𝑤, 𝑥, 𝑦, 𝑧 = (0,1,2,4,5,6,8,9,12,13,14)

𝑭 = 𝒚′ + 𝒘′ 𝒛′ + 𝒙𝒛′ 25
 Reduce and Implement the following Boolean Expression
𝑌 = 𝐴 𝐵𝐶 𝐷 + 𝐴𝐵𝐶𝐷 + 𝐴𝐵𝐶𝐷 + 𝐴𝐵𝐶𝐷 + 𝐴 𝐵 𝐶 𝐷 + 𝐴𝐵𝐶 𝐷 + 𝐴 𝐵 C D + 𝐴 𝐵 𝐶 𝐷
In values, 𝑌 = 0010 1110 1010 1011 1000 1100 0011 0000
Mapping Implementation

𝑌 = 𝐵𝐶 + A𝐷 + 𝐵 𝐷
26
 Reduce the following Boolean expression
𝐹 = 𝐵′ 𝐶 ′ + 𝐴𝐵′ + 𝐴𝐵𝐶 ′ + 𝐴𝐶𝐷′ + 𝐴′ 𝐵′ 𝐶 ′ 𝐷 + 𝐴𝐵′ 𝐶𝐷

B’C’ AB’ ABC’ ACD’ A’B’C’D AB’CD

In canonical form
0000 1000 1100 1010 0001 1011
0001 1001 1101 1110
1000 1010
1001 1011

27
𝐹 = 𝐵′ 𝐶 ′ + 𝐴𝐷′ + 𝐴𝐶 ′ + 𝐴𝐵′

28
Example:
Simplification of Product of sums(POS/POM)
Simplify the following function using K map 𝑓 = 𝑀(0,2,3,8,9,12,13,15)

𝑓 ′ = 𝐴′ 𝐵′ 𝐶 + 𝐴𝐵𝐷 + 𝐴′ 𝐵′ 𝐷′ + 𝐴𝐶′

𝑓 = (𝐴 + 𝐵 + 𝐶 ′ )(𝐴′ + 𝐵′ + 𝐷′ )(𝐴 + 𝐵 + 𝐷)(𝐴′ + 𝐶)

29