NAVSAHYADRI EDUCATION SOCIETY’S GROUP OF INSTITUTIONS

DEPARTMENT OF COMPUTER ENGINEERING

ACADEMIC YEAR: 2024-25 SEMESTER- III

UNIT - 1
“Minimization techniques”
By
Prof. Dipali Gupta
Assistant Professor
Computer Department
 Combinational Logic Circuits
 Introduction
 Standard representation of canonical forms (SOP &
POS), Maxterm and Minterm , Conversion between SOP
and POS forms
 K-map reduction techniques upto 4 variables (SOP & POS form),
Design of Half Adder, Full Adder, Half Subtractor & Full Subtractor
using k-Map
 Code Converter using K-map: Gray to Binary Binary to Gray Code
Converter (upto 4 bit)
 IC 7447 as BCD to 7- Segment decoder driver
 IC 7483 as Adder & Subtractor, 1 Digit BCD Adder
 Block Schematic of ALU IC 74181 IC 74381
Standard Representation

 Any logical expression can be expressed in the

following two forms:
 Sum of Product (SOP) Form
 Product of Sum (POS) Form
SOP Form

For Example, logical expression given is;

Sum
 
Y  A.B  B.C  A.C
Product
POS Form

For Example, logical expression given is;

Product

Y  ( A  B).(B  C).( A  C)
Sum
Standard or Canonical SOP & POS Forms

 We can say that a logic expression is said to be

in the standard (or canonical) SOP or POS form
if each product term (for SOP) and sum term
(for POS) consists of all the literals in their
complemented or uncomplemented form.
Standard SOP

 

Y  ABC  ABC  ABC

 

Each product term

consists all the
literals
 Standard POS

Y  ( A B  C).( A  B  C).( A  B  C)

  

Each sum term

consists all the
literals
 Examples

Sr. No. Expression Type

1 Non Standard SOP

Y  AB  ABC  ABC
2 Standard SOP
Y  AB  AB  AB

3 Standard POS
Y  ( A  B).( A  B).( A  B)

4 Non Standard POS

Y  ( A  B).( A  B  C)
Conversion of SOP form to Standard SOP

Procedure:
1. Write down all the terms.
2. If one or more variables are missing in any
product term, expand the term by
multiplying it with the sum of each one of
the missing variable and its complement .
3. Drop out the redundant terms
 Example 1


Y  AB  AC  BC


Convert given expression into its standard SOP form

Y  AB  AC  BC

Missing literal is A
Missing literal is B

Missing literal is C

  

Y  AB.(C  C)  AC.(B  B)  BC.( A  A)

  

Term formed by ORing of missing

literal & its complement
Example 1 Continue….

  

Y  AB.(C  C)  AC.(B  B)  BC.( A  A)

  

   

Y  ABC  ABC  ABC  ABC  ABC  ABC

   

  

Y  ABC  ABC  ABC  ABC  ABC  ABC

  

Y  ABC  ABC  ABC  ABC

  

Standard SOP form

Each product term consists all the literals
Conversion of POS form to Standard POS

Procedure:
1. Write down all the terms.
2. If one or more variables are missing in any
sum term, expand the term by adding the
products of each one of the missing variable
and its complement .
3. Drop out the redundant terms
 Example 2
Convert given expression into its standard SOP form Y  ( A  B).( A  C)  (B  C)

Y  ( A  B).( A  C)  (B  C)

Missing literal is A
Missing literal is B

Missing literal is C
 

Y  ( A  B  CC).( A  C  BB).(B  C  AA)

 

Term formed by ANDing of missing

literal & its complement
Example 2 Continue….

 

Y  ( A  B  CC).( A  C  BB).(B  C  AA)

 

Y  ( A  B  C)( A  B  C).(A  B  C)(A  B  C).(A  B  C)(A  B  C)

Y  ( A  B  C)( A  B  C)( A  B  C)( A  B  C)

Y  (A  B  C)(A  B  C)(A  B  C)(A  B  C)

Standard POS form

Each sum term consists all the literals
Concept of Minterm and Maxterm

 Minterm: Each individual term in the standard

SOP form is called as “Minterm”.

 Maxterm: Each individual term in the standard

POS form is called as “Maxterm”.
 The concept of minterm and max term allows
us to introduce a very convenient shorthand
notation to express logic functions
Minterms & Maxterms for 3 variable/literal logic function
Variables Minterms Maxterms

A B C mi Mi

0 0 0
ABC  m0 A B C  M 0
0 0 1
ABC  m1 A B C  M1
0 1 0
ABC  m2 A B C  M 2
0 1 1
ABC  m3 A B C  M3
1 0 0
ABC  m4 A B C  M 4
1 0 1
ABC  m5 A B C  M5
1 1 0
ABC  m6 A B C  M 6
1 1 1 ABC  m7 A B C  M 7

18
Minterms and maxterms

 Each minterm is represented by mi where

i=0,1,2,3,…….,2n-1
 Each maxterm is represented by Mi where
i=0,1,2,3,…….,2n-1
 If ‘n’ number of variables forms the function,
then number of minterms or maxterms will be
2n
• i.e. for 3 variables function f(A,B,C), the number of
minterms or maxterms are 23=8
Minterms & Maxterms for 2 variable/literal logic
function

Variables Minterms Maxterms

A B mi Mi

0 0
AB  m0 A B  M 0
0 1
AB  m1 A B  M1
1 0
AB  m2 A B  M 2
1 1 AB  m3 A B  M3
Representation of Logical expression using minterm

  

Y  ABC  ABC  ABC  ABC

  

Logical Expression

m7 m3 m4 m5 Corresponding
minterms

Y  m7  m3 m4  m5

Y  m(3, 4, 5, 7) OR

Y  f ( A, B, C)  m(3, 4, 5, 7)

where  denotes sum of products

Representation of Logical expression using maxterm

  

Y  ( A  B  C).( A  B  C).( A  B  C)
  

Logical Expression

M2 M0 M6 Corresponding
maxterms

Y  M 2.M 0.M 6

Y  M (0, 2, 6) OR

Y  f ( A, B, C)  M (0, 2, 6)

where  denotes product of sum

Conversion from SOP to POS & Vice versa

 The relationship between the expressions

using minters and maxterms is
complementary.

 We can exploit this complementary

relationship to write the expressions in terms
of maxterms if the expression in terms of
minterms is known and vice versa
Conversion from SOP to POS & Vice versa

 For example, if a SOP expression for 4 variable

is given by,
Y  m(0,1, 3, 5, 6, 7,11,12,15)

 Then we can get the equivalent POS

expression using the complementary
relationship as follows,

Y  M (2, 4,8, 9,10,13,14)

 Examples

1. Convert the given expression into standard

form Y  A  BC  ABC

2. Convert the given expression into standard



form Y  ( A  B).( A  C)

 Combinational Logic Circuits
 Introduction
 Standard representation of canonical forms (SOP & POS),
Maxterm and Minterm , Conversion between SOP and POS forms
 K-map reduction techniques upto 4 variables (SOP &
POS form), Design of Half Adder, Full Adder, Half Subtractor &
Full Subtractor using k-Map
 Code Converter using K-map: Gray to Binary, Binary to Gray Code
Converter (upto 4 bit)
 IC 7447 as BCD to 7- Segment decoder driver
 IC 7483 as Adder & Subtractor, 1 Digit BCD Adder
 Block Schematic of ALU IC 74181 IC 74381
Karnaugh Map (K-map)

 In the algebraic method of simplification, we

need to write lengthy equations, find the
common terms, manipulate the expressions
etc., so it is time consuming work.

 Thus “K-map” is another simplification

technique to reduce the Boolean equation.
Karnaugh Map (K-map)

 It overcomes all the disadvantages of algebraic

simplification techniques.

 The information contained in a truth table or

available in the SOP or POS form is
represented on K-map.
Karnaugh Map (K-map)

 K-map Structure - 2 Variable

 A & B are variables or inputs
 0 & 1 are values of A & B
 2 variable k-map consists of 4 boxes i.e. 22=4

A
B 0 1

1
Karnaugh Map (K-map)

 K-map Structure - 2 Variable

 Inside 4 boxes we have enter values of Y i.e.
output

A A
A A
B 0 1 B 0 1

0 AB AB 0 m0 m1
B
B 1 AB AB 1 m2 m3
K-map & its associated minterms
Karnaugh Map (K-map)
 Relationship between Truth Table & K-map

A
B 0 1

A B Y 0
0 0

0 0 0 1 1 1

0 1 1

1 0 0
B
1 1 1 A 0 1

0 0 1

1 0 1
 Karnaugh Map (K-map)
 K-map Structure - 3 Variable
 A, B & C are variables or inputs
AB  3 variable k-map consists of 8 boxes i.e. 23=8
C A
BC 0 1
0
00
1
01
BC
00 01 11 10 11
A
10
0

1
 Karnaugh Map (K-map)
 3 Variable K-map & its associated product
terms
AB
C 00 01 11 10 A
BC 0 1
0 ABC ABC ABC ABC
00 ABC ABC
1 ABC ABC ABC ABC
01 ABC ABC
BC
01 11 10 11 ABC ABC
A 00
10
0 ABC ABC ABC ABC ABC ABC

1 ABC ABC ABC ABC

 Karnaugh Map (K-map)
 3 Variable K-map & its associated minterms

AB
00 01 11 10
C A
BC 0 1
0 m0 m2 m6 m4
00 m0 m4
1 m1 m3 m7 m5
01 m1 m5
BC m3 m7
00 01 11 10 11
A

0
m0 m1 m3 m 2 10 m 2 m6
1 m 4 m5 m7 m6
 Karnaugh Map (K-map)
 K-map Structure - 4 Variable
 A, B, C & D are variables or inputs
 4 variable k-map consists of 16 boxes i.e. 24=16
AB CD
CD 00 01 11 10 AB 00 01 11 10

00 00

01 01

11 11

10 10
 Karnaugh Map (K-map)
 4 Variable K-map and its associated product
terms

AB CD
CD 00 01 11 10 AB 00 01 11 10

00 ABC D ABC D ABC D ABC D 00 ABC D ABCD ABCD ABCD

01 ABCD ABCD ABCD ABCD 01 ABC D ABCD ABCD ABCD

11 ABCD ABCD ABCD ABCD 11 ABC D ABCD ABCD ABC D

10 ABCD ABCD ABC D ABCD 10 ABC D ABCD ABCD ABCD

 Karnaugh Map (K-map)
 4 Variable K-map and its associated minterms

AB CD
CD 00 01 11 10 AB 00 01 11 10

m0 m4 m12 m8 m0 m1 m3 m2
00 00

01 m1 m5 m13 m9 01 m4 m5 m7 m6

11 m3 m7 m15 m11 11 m12 m13 m15 m14

10 m2 m6 m11 m10 10 m8 m9 m11 m10

 Representation of Standard SOP form expression on K-map
For example, SOP equation is given as
  
 

Y  ABC ABC  ABC  ABC  ABC



 The given expression is in the standard SOP form.

 Each term represents a minterm.
 We have to enter ‘1’ in the boxes corresponding to each
minterm as below ABC ABC
BC BC BC BC BC
A 00 01 11 10
1 1 0 0
A 0

A 1 1 0 1 1
ABC

ABC ABC 38
Simplification of K-map

 Once we plot the logic function or truth table

on K-map, we have to use the grouping
technique for simplifying the logic function.
 Grouping means the combining the terms in
adjacent cells.
 The grouping of either 1’s or 0’s results in the
simplification of boolean expression.
Simplification of K-map

 If we group the adjacent 1’s then the result of

simplification is SOP form
 If we group the adjacent 0’s then the result of
simplification is POS form
Grouping

 While grouping, we should group most

number of 1’s.
 The grouping follows the binary rule i.e we
can group 1,2,4,8,16,32,…..…number of 1’s.
 We cannot group 3,5,7,………number of 1’s
 Pair: A group of two adjacent 1’s is called as
Pair
 Quad: A group of four adjacent 1’s is called as
Quad
 Octet: A group of eight adjacent 1’s is called as
OCTET 41
Grouping of Two Adjacent 1’s : Pair

 A pair eliminates 1 variable

ABC ABC

BC BC BC BC BC

A 00 01 11 10 


0 0 1 1
A 0 Y  ABC ABC
0 0 0 0
A 1 Y  AB(C  C)
Y  AB ( C  C  1)
 Grouping of Two Adjacent 1’s : Pair

BC BC BC BC BC BC BC BC BC BC
00 01 11 10 A 00 01 11 10
A
0 0 0 0 0 1 1 1
A 0 A 0
1 0 0 1 A 1 0 0 1 0
A 1

BC BC BC BC BC B
A 00 01 11 10 A 0 1
0 1 0 0 1 1
A 0 0

A 1 0 1 0 0 1 0
1
 Grouping of Two Adjacent 1’s : Pair

CD CD CD CD CD
AB 00 01 11 10
0 1 0 0
AB 00
0 0 0 0
AB 01

AB 11 0 0 0 0

0 1 0 0
AB 10
 Possible Grouping of Four Adjacent 1’s : Quad

 A Quad eliminates 2 variable

CD CD CD CD CD CD CD CD CD CD
AB 00 01 11 10 AB 00 01 11 10
0 0 0 0 0 1 0 0
AB 00 AB 00
0 0 0 0 0 1 0 0
AB 01 AB 01

AB 11 0 0 0 0 AB 11 0 1 0 0

AB 10 1 1 1 1 0 1 0 0
AB 10
 Possible Grouping of Four Adjacent 1’s : Quad

 A Quad eliminates 2 variable

CD CD
AB 00 01 11 10 AB 00 01 11 10
0 0 0 0 0 1 1 0
00 00

01 1 1 0 0 01 0 0 0 0

11 1 1 0 0 11 0 0 0 0

0 0 0 0 0 1 1 0
10 10
 Possible Grouping of Four Adjacent 1’s : Quad

 A Quad eliminates 2 variable

CD CD
AB 00 01 11 10 AB 00 01 11 10
1 0 0 1 0 0 0 0
AB 00 00
0 0 0 0 1 0 0 1
01 01

0 0 0 0 1 0 0 1
11 11

1 0 0 1 0 0 0 0
AB 10 10
 Possible Grouping of Four Adjacent 1’s : Quad

 A Quad eliminates 2 variable

CD CD
AB 00 01 11 10 AB 00 01 11 10
0 0 0 0 0 0 0 0
00 00

01 0 1 1 1 01 0 1 1 0

11 0 1 1 1 11 0 1 1 0

0 0 0 0 0 1 1 0
10 10
 Possible Grouping of Eight Adjacent 1’s : Octet

 A Octet eliminates 3 variable

CD CD
AB 00 01 11 10 AB 00 01 11 10
0 0 0 0 0 1 1 0
00 00

01 0 0 0 0 01 0 1 1 0

11 1 1 1 1 11 0 1 1 0

1 1 1 1 0 1 1 0
10 10
 Possible Grouping of Eight Adjacent 1’s : Octet

 A Octet eliminates 3 variable

CD CD
AB 00 01 11 10 AB 00 01 11 10
1 1 1 1 1 0 0 1
AB 00 AB 00
0 0 0 0 1 0 0 1
01 01

0 0 0 0 1 0 0 1
11 11

1 1 1 1 1 0 0 1
AB 10 AB 10
Rules for K-map simplification
1. Groups may not include any cell containing a
zero.
A A A A
A A
0 1 0 1
B B
0 0
B 0 B 0
1 1 1
B 1 B 1

Not Accepted Accepted

Rules for K-map simplification
2. Groups may be horizontal or vertical, but may
not be diagonal
A A A A
A A
0 1 0 1
B B
0 1 0 1
B 0 B 0
1 0 1 1
B 1 B 1

Not Accepted Accepted

 Rules for K-map simplification
3. Groups must contain 1,2,4,8 or in general 2n
Bc
Cells
BC BC BC BC BC BC BC BC BC
A 00 01 11 10 A 00 01 11 10

0 1 1 1 0 1 1 1
A 0 A 0
0 0 0 0 A 1 0 0 0 0
A 1

A
A A A
A A
B 0 1 B 0 1

1 1 1 1
B 0 B 0
0 1 0 1
B 1 B 1

53
Not Accepted Accepted
 Rules for K-map simplification
4. Each group should be as large as possible

BC BC BC BC BC BC BC BC BC BC
00 01 11 10 A 00 01 11 10
A
1 1 1 1 1 1 1 1
A 0 A 0
0 0 1 1 A 1 0 0 1 1
A 1

Not Accepted Accepted

Rules for K-map simplification

5. Each cell containing a one must be in at least

one group

BC BC BC BC BC
A 00 01 11 10
0 0 0 1
A 0

A 1 0 0 1 0
Rules for K-map simplification

6. Groups may be overlap

BC BC BC BC BC
A 00 01 11 10
1 1 1 1
A 0

A 1 0 0 1 1
 Rules for K-map simplification

7. Groups may wrap around the table. The leftmost cell in

a row may be grouped with rightmost cell and the top
cell in a column may be grouped with bottom cell

CD
AB 00 01 11 10
BC BC BC BC
1 1 1 1 BC 00 01 11 10
AB 00 A
1 0 0 1
01 0 0 0 0 A 0

A 1 1 0 0 1
11 0 0 0 0

1 1 1 1
AB 10
 Rules for K-map simplification
8. There should be as few groups as possible, as long as
this does not contradict any of the previous rules.

BC BC BC BC BC BC BC BC BC BC
00 01 11 10 A 00 01 11 10
A
1 1 1 1 1 1 1 1
A 0 A 0
0 0 1 1 A 1 0 0 1 1
A 1

Not Accepted Accepted

Rules for K-map simplification

9. A pair eliminates one variable.

10. A Quad eliminates two variables.

11. A octet eliminates three variables

Example 1

For the given K-map write simplified Boolean

expression

AB AB AB AB AB
C 00 01 11 10
0 1 1 1
C 0

C 1 0 0 1 0
Example 1 continue…..

AB AB AB AB AB
C 00 01 11 10
0 1 1 1
0 AC

0 0 1 0
1

BC AB

Simplified Boolean expression

Y  BC  AB  AC
Example 2

For the given K-map write simplified Boolean

expression

AB AB AB AB AB
C 00 01 11 10
1 1 0 1
C 0

C 1 1 0 0 1
Example 2 continue…..

AB AB AB AB AB
C 00 01 11 10
1 1 0 1
0
1 0 0 1
1

AC B

Simplified Boolean expression

Y  B  AC
Example 3

A logical expression in the standard SOP form is

as follows;
  

Y  ABC  ABC  ABC  ABC

   

Minimize it with using the K-map technique

 Example 3 continue……
  

Y  ABC  ABC  ABC  ABC

   

BC BC BC BC BC AB
A 00 01 11 10
1 0 1 1
A 0

A 1 0 1 0 0

AC
ABC

Simplified Boolean
expression 


8/29/2017 Y  AC  AB  ABC 65
Example 4

A logical expression representing a logic circuit

is;
Y  m(0,1, 2, 5,13,15)
Draw the K-map and find the minimized logical
expression
 Example 4 continue…..

Y  m(0,1, 2, 5,13,15)

CD CD CD CD
AB 00 01 11 10 ABD
1 0 1 1 0 3 1 2
AB 00
0 4 1 5 0 7 0 6
AB 01

AB 11 0 12 1 13 1 15 0 14
Simplified Boolean
expression
AB 10 0 8 0 9 0 11 0 10
Y  ABD  ACD  ABD

ACD ABD
Example 5

Minimize the following Boolean expression using

K-map ;

f ( A, B, C, D)  m(1, 3, 5, 9,11,13)
 Example 5 continue…..

f ( A, B, C, D)  m(1, 3, 5, 9,11,13)

CD CD CD CD CD
AB 00 01 11 10
0 0 1 1 1 3 0 2
AB 00
0 4 1 5 0 7 0 6
AB 01

AB 11 0 12 1 13 0 15 0 14
Simplified Boolean
expression
AB 0 8 1 9 1 11 0 10
10
f  BD  CD
f  D(B  C)
BD CD
Example 6

Minimize the following Boolean expression using

K-map ;

f ( A, B, C, D)  m(4, 5,8, 9,11,12,13,15)

 Example 6 continue…..

f (A, B,C, D)  m(4,5,8,9,11,12,13,15)

CD CD CD CD CD
AB 00 01 11 10
BC
0 0 0 1 0 3 0 2
AB 00
1 4 1 5 0 7 0 6
AB 01

AB 11 1 12 1 13 1 15 0 14
Simplified Boolean
expression
AB 10 1 8 1 9 1 11 0 10



f  BC  AC  AD

AC AD
Example 7

Minimize the following Boolean expression using

K-map ;

f 2( A, B, C, D)  m(0,1, 2, 3,11,12,14,15)
 Example 7 continue…..

f 2(A, B,C, D)  m(0,1, 2,3,11,12,14,15)

CD
AB 00 01 11 10
AB
1 0 1 1 1 3 1 2
AB 00
0 4 0 5 0 7 0 6
AB 01

AB 11 1 12 0 13 1 15 1 14
Simplified Boolean
expression
AB 10 0 8 0 9 1 11 0 10
 

f 2  AB  ABD  ACD



ABD ACD
Example 8

Solve the following expression with K-maps;

1. f 1( A, B, C)  m(0,1, 3, 4, 5)
2.
f 2( A, B, C)  m(0,1, 2, 3, 6, 7)
 Example 8 continue……

f 1(A, B,C)  m(0,1,3, 4,5) f 2(A, B,C)  m(0,1, 2,3, 6, 7)

AC
BC BC BC BC BC BC BC BC BC BC
A 00 01 11 10 A 00 01 11 10

1 0 1 1 1 3 0 2 1 0 1 1 1 3 1 2
A 0 0
4 4 0 5 1 7 1 6
A 1 1 1 5 0 7 0 6 1 0

B A B

Simplified Boolean Simplified Boolean

expression expression
f 1  AC  B f 2  A B
Example 9

Simplify ;

f ( A, B, C, D)  m(0,1, 4, 5, 7,8, 9,12,13,15)

 Example 9 continue…..

f (A, B,C, D)  m(0,1, 4,5,7,8,9,12,13,15)

CD CD CD CD CD
AB 00 01 11 10
1 0 1 1 0 3 0 2
AB 00

AB 01 1 4 1 5 1 7 0 6

AB 11 1 12 1 13 1 15 0 14
Simplified Boolean
exprefssiCon BD
AB 10 1 8 1 9 0 11 0 10

C BD
Example 10

Solve the following expression with K-maps;

1. f 1( A, B, C, D)  m(0,1, 3, 4, 5, 7)
2.
f 2( A, B, C)  m(0,1, 3, 4, 5, 7)
 Example 10 continue……

f 1(A, B,C, D)  m(0,1,3, 4,5, 7) f 2(A, B,C)  m(0,1,3, 4,5, 7)

CD CD CD CD CD
AB 00 01 11 10
BC BC BC BC BC
1 0 1 1 0 3 0 2 A 00 01 11 10
AB 00
1 0 1 1 1 3 0 2
AB 01 1 4 1 5 1 7 0 6 A 0
4 1 5 1 7 0 6
A 1 1
AB 11 0 12 0 13 0 15 0 14

AB 10 0 8 0 9 0 11 0 10 B C

Simplified Boolean
AC AD expression
Simplified Boolean f 2  B C
expre ssion f  AC  AD

 

1
8/29/2017 79
K-map and don’t care conditions

 For SOP form we enter 1’s corresponding to

the combinations of input variables which
produce a high output and we enter 0’s in the
remaining cells of the K-map.
 For POS form we enter 0’s corresponding to
the combinations of input variables which
produce a high output and we enter 1’s in the
remaining cells of the K-map.
K-map and don’t care conditions

 But it is not always true that the cells not

containing 1’s (in SOP) will contain 0’s,
because some combinations of input variable
do not occur.
 Also for some functions the outputs
corresponding to certain combinations of
input variables do not matter.
K-map and don’t care conditions

 In such situations we have a freedom to

assume a 0 or 1 as output for each of these
combinations.
 These conditions are known as the “Don’t
Care Conditions” and in the K-map it is
represented as ‘X’, in the corresponding cell.
 The don’t care conditions may be assumed to
be 0 or 1 as per the need for simplification
K-map and don’t care conditions - Example

Simplify ;

f ( A, B, C, D)  m(1, 3, 7,11,15) d (0, 2, 5)

K-map and don’t care conditions - Example

f (A, B,C, D)  m(1,3, 7,11,15)  d(0, 2,5)

CD CD CD CD CD
AB 00 01 11 10
X 0 1 1 1 3 X 2
AB 00
0 4 X 5 1 7 0 6
AB 01

AB 11 0 12 0 13 1 15 0 14
Simplified Boolean
expression
AB 10 0 8 0 9 1 11 0 10 f  CD  AB  AD


AB AD CD