Minimization Techniques in Deld

Pune Vidyarthi Grihas
COLLEGE OF ENGINEERING, NASIK - 4
Minimization techniques
By
Prof. Anand N. Gharu
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
8/29/2017 2
Standard Representation
Any logical expression can be expressed in the

following two forms:
Sum of Product (SOP) Form
Product of Sum (POS) Form
8/29/2017 3
SOP Form
For Example, logical expression given is;
Sum
Y A.B B.C A.C

Product
8/29/2017 4
POS Form
For Example, logical expression given is;

Product
Y ( A B ).( B C ).( A C )
Sum
8/29/2017 5
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.
8/29/2017 6
Standard SOP
Y ABC ABC ABC

Each product term
consists all the
literals
8/29/2017 7
Standard POS
Y ( A B C ).( A B C ).( A B C )
Each sum term
consists all the
literals
8/29/2017 8
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 )
8/29/2017 9
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
8/29/2017 10
Example 1
Convert given expression into its standard SOP form Y AB AC BC
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
8/29/2017 11
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
8/29/2017 12
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
8/29/2017 13
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
8/29/2017 14
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
8/29/2017 15
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.
8/29/2017 16
The concept of minterm and max term allows
us to introduce a very convenient shorthand
notation to express logic functions
8/29/2017 17
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 m 2 A B C M 2
0 1 1
ABC m3 A B C M3
1 0 0 ABC m 4 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 8/29/2017 1 1 Nevase
ABCAmit 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
8/29/2017 19
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 m 2 A B M 2
1 1 AB m3 A B M3
8/29/2017 20
Representation of Logical expression using minterm
Y ABC ABC ABC ABC Logical Expression
m7 m3 m4 m5 Corresponding
minterms
Y m 7 m3 m 4 m5
Y m(3, 4,5, 7) OR
Y f ( A, B, C ) m(3, 4,5, 7)
where denotes sum of products

8/29/2017 21
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
8/29/2017 22
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
8/29/2017 23
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)

8/29/2017 24
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 )
8/29/2017 25
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
8/29/2017 26
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.
8/29/2017 27
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.
8/29/2017 28
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
8/29/2017 29

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
8/29/2017 30
Relationship between Truth Table & K-map
A A
A
B 0 1
A B Y 0 0
B 0
0 0 0 1 1 1
B
0 1 1
1 0 0
B B
B
1 1 1 A 0 1
A 0 0 1
A 1 0 1
8/29/2017 31
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
8/29/2017 32
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
ABC ABC ABC 10 ABC ABC

0 ABC
1 ABC ABC ABC ABC
8/29/2017 33
3 Variable K-map & its associated minterms
AB
00 01 11 10
C A
BC 0 1
0 m0 m 2 m6 m 4
00 m0 m4
1 m1 m3 m7 m5
01 m1 m5
BC
A 00 01 11 10 11 m3 m7
0 m0 m1 m3 m 2 10 m2 m6
1 m 4 m5 m 7 m 6
8/29/2017 34
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
8/29/2017 35
4 Variable K-map and its associated product
terms
AB CD
CD 00 01 11 10 AB 00 01 11 10
00 ABCD ABCD ABCD ABCD 00 ABCD ABCD ABCD ABCD
8/29/2017 36
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
8/29/2017 37
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
8/29/2017 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 1s or 0s results in the
simplification of boolean expression.
8/29/2017 39
Simplification of K-map
If we group the adjacent 1s then the result of

simplification is SOP form
If we group the adjacent 0s then the result of
simplification is POS form
8/29/2017 40
Grouping
While grouping, we should group most

number of 1s.
The grouping follows the binary rule i.e we
can group 1,2,4,8,16,32,..number of 1s.
We cannot group 3,5,7,number of 1s
Pair: A group of two adjacent 1s is called as
Pair
Quad: A group of four adjacent 1s is called as
Quad
Octet: A group of eight adjacent 1s is called as
Octet
8/29/2017 41
Grouping of Two Adjacent 1s : 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)
8/29/2017 42
BC BC BC BC BC BC BC BC BC BC
A 00 01 11 10 A 00 01 11 10
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 B B
A 00 01 11 10 A 0 1
0 1 0 0 1 1
A 0 A 0
A 1 0 1 0 0 A 1 1 0
8/29/2017 43
CD CD CD CD CD
AB 00 01 11 10
0 1 0 0
AB 00
01 0 0 0 0
AB
AB 11 0 0 0 0
0 1 0 0
AB 10
8/29/2017 44
Possible Grouping of Four Adjacent 1s : 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
01 0 0 0 0 01 0 1 0 0
AB AB
AB 11 0 0 0 0 AB 11 0 1 0 0
1 1 1 1 0 1 0 0
AB 10 AB 10
8/29/2017 45

AB 00 01 11 10 AB 00 01 11 10
0 0 0 0 0 1 1 0
AB 00 AB 00
01 1 1 0 0 01 0 0 0 0
AB AB
AB 11 1 1 0 0 AB 11 0 0 0 0
0 0 0 0 0 1 1 0
AB 10 AB 10
8/29/2017 46

AB 00 01 11 10 AB 00 01 11 10
1 0 0 1 0 0 0 0
AB 00 AB 00
01 0 0 0 0 01 1 0 0 1
AB AB
AB 11 0 0 0 0 AB 11 1 0 0 1
1 0 0 1 0 0 0 0
AB 10 AB 10
8/29/2017 47

AB 00 01 11 10 AB 00 01 11 10
0 0 0 0 0 0 0 0
AB 00 AB 00
01 0 1 1 1 01 0 1 1 0
AB AB
AB 11 0 1 1 1 AB 11 0 1 1 0
0 0 0 0 0 1 1 0
AB 10 AB 10
8/29/2017 48
Possible Grouping of Eight Adjacent 1s : Octet
A Octet eliminates 3 variable

AB 00 01 11 10 AB 00 01 11 10
0 0 0 0 0 1 1 0
AB 00 AB 00
01 0 0 0 0 01 0 1 1 0
AB AB
AB 11 1 1 1 1 AB 11 0 1 1 0
1 1 1 1 0 1 1 0
AB 10 AB 10
8/29/2017 49
Possible Grouping of Eight Adjacent 1s : Octet
A Octet eliminates 3 variable

AB 00 01 11 10 AB 00 01 11 10
1 1 1 1 1 0 0 1
AB 00 AB 00
01 0 0 0 0 01 1 0 0 1
AB AB
AB 11 0 0 0 0 AB 11 1 0 0 1
1 1 1 1 1 0 0 1
AB 10 AB 10
8/29/2017 50
Rules for K-map simplification
1. Groups may not include any cell containing a

zero.
A
A A A
A A
B 0 1 B 0 1
0 0
B 0 B 0
1 1 1
B 1 B 1
Not Accepted Accepted
8/29/2017 51
2. Groups may be horizontal or vertical, but may

not be diagonal
A
A A A
A A
B 0 1 B 0 1
0 1 0 1
B 0 B 0
1 0 1 1
B 1 B 1
8/29/2017 52
3. Groups must contain 1,2,4,8 or in general 2n

cellsBC BC BC BC
BC BC BC BC
01
BC
11
BC
10
A 00 01 11 10 A 00
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
8/29/2017
Not Accepted Accepted 53
4. Each group should be as large as possible
A 00 01 11 10 A 00 01 11 10
1 1 1 1 1 1 1 1
A 0 A 0
0 0 1 1 A 1 0 0 1 1
A 1
8/29/2017 54
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
8/29/2017 55
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
8/29/2017 56
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 CD CD CD CD
AB 00 01 11 10
1 1 1 1 BC BC BC BC BC
AB 00 A 00 01 11 10
0 0 0 0 1 0 0 1
AB 01
A 0
AB 11 0 0 0 0 A 1 1 0 0 1
1 1 1 1
AB 10
8/29/2017 57
8. There should be as few groups as possible, as long as

this does not contradict any of the previous rules.
A 00 01 11 10 A 00 01 11 10
1 1 1 1 1 1 1 1
A 0 A 0
0 0 1 1 A 1 0 0 1 1
A 1
8/29/2017 58
9. A pair eliminates one variable.
10. A Quad eliminates two variables.
11. A octet eliminates three variables
8/29/2017 59
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
8/29/2017 60
Example 1 continue..
AB AB AB AB AB
C 00 01 11 10
0 1 1 1
C 0 AC
C 1 0 0 1 0
BC AB
Simplified Boolean expression

Y BC AB AC
8/29/2017 61
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
8/29/2017 62
AB AB AB AB AB
C 00 01 11 10
1 1 0 1
C 0
C 1 1 0 0 1
AC B
Simplified Boolean expression

Y B AC
8/29/2017 63
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
8/29/2017 64
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
8/29/2017 66
Y m(0,1, 2, 5,13,15)
CD CD CD CD CD
AB 00 01 11 10 ABD
1 0 1 1 0 3 1 2
AB 00
01 0 4 1 5 0 7 0 6
AB
AB 11 0 12 1 13 1 15 0 14
Simplified Boolean
expression
0 8 0 9 0 11 0 10
AB 10
Y ABD ACD ABD
ACD ABD
8/29/2017 67
Example 5
Minimize the following Boolean expression using

K-map ;
f ( A, B, C , D) m(1,3,5,9,11,13)
8/29/2017 68
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
01 0 4 1 5 0 7 0 6
AB
AB 11 0 12 1 13 0 15 0 14
Simplified Boolean
expression
0 8 1 9 1 11 0 10
AB 10
f BD CD
f D( B C )
BD CD
8/29/2017 69
Example 6

K-map ;
f ( A, B, C , D) m(4,5,8,9,11,12,13,15)
8/29/2017 70
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
01 1 4 1 5 0 7 0 6
AB
AB 11 1 12 1 13 1 15 0 14
Simplified Boolean
expression
1 8 1 9 1 11 0 10
AB 10
f BC AC AD
AC AD
8/29/2017 71
Example 7

K-map ;
f 2( A, B, C , D) m(0,1, 2,3,11,12,14,15)
8/29/2017 72
f 2( A, B, C, D) m(0,1, 2,3,11,12,14,15)
CD CD CD CD CD
AB 00 01 11 10
AB
1 0 1 1 1 3 1 2
AB 00
01 0 4 0 5 0 7 0 6
AB
AB 11 1 12 0 13 1 15 1 14
Simplified Boolean
expression
0 8 0 9 1 11 0 10
AB 10
f 2 AB ABD ACD
ABD ACD
8/29/2017 73
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)
8/29/2017 74
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
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 A 0
4
1
4
1 5 0 7 0 6 A 1 0 0 5 1 7 1 6
A 1
A B
B
Simplified Boolean Simplified Boolean

expression expression
f 1 AC B f 2 A B
8/29/2017 75
Example 9
Simplify ;
f ( A, B, C , D) m(0,1, 4,5, 7,8,9,12,13,15)
8/29/2017 76
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
01 1 4 1 5 1 7 0 6
AB
AB 11 1 12 1 13 1 15 0 14
Simplified Boolean
expression
f C BD
1 8 1 9 0 11 0 10
AB 10
C BD
8/29/2017 77
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)
8/29/2017 78
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
01 1 4 1 5 1 7 0 6 A 0
AB
4
1 1 5 1 7 0 6
AB 11 0 12 0 13 0 15 0 14 A 1
AB 10 0 8 0 9 0 11 0 10 B C
Simplified Boolean
AC AD
expression
Simplified Boolean f 2 BC
expression f AC AD
8/29/2017
1
79
K-map and dont care conditions
For SOP form we enter 1s corresponding to

the combinations of input variables which
produce a high output and we enter 0s in the
remaining cells of the K-map.
For POS form we enter 0s corresponding to
the combinations of input variables which
produce a high output and we enter 1s in the
remaining cells of the K-map.
8/29/2017 80
But it is not always true that the cells not

containing 1s (in SOP) will contain 0s,
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.
8/29/2017 81
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 Dont
Care Conditions and in the K-map it is
represented as X, in the corresponding cell.
The dont care conditions may be assumed to
be 0 or 1 as per the need for simplification
8/29/2017 82
K-map and dont care conditions - Example
Simplify ;
f ( A, B, C , D) m(1,3, 7,11,15) d (0, 2,5)
8/29/2017 83
K-map and dont 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
01 0 4 X 5 1 7 0 6
AB
AB 11 0 12 0 13 1 15 0 14
Simplified Boolean
expression
0 8 0 9 1 11 0 10 f CD AB AD
AB 10
AB AD CD
8/29/2017 Amit Nevase 84

Minimization Techniques in Deld

Uploaded by

Copyright:

Available Formats

Minimization Techniques in Deld

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Minimization Techniques in Deld

Uploaded by

Copyright:

Available Formats

Pune Vidyarthi Grihas

COLLEGE OF ENGINEERING, NASIK - 4

Any logical expression can be expressed in the

For Example, logical expression given is;

Y A.B B.C A.C

For Example, logical expression given is;

We can say that a logic expression is said to be

Y ABC ABC ABC

Sr. No. Expression Type

1 Non Standard SOP

4 Non Standard POS

Y AB.(C C ) AC.( B B ) BC.( A A)

Term formed by ORing of missing

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

Y ( A B CC ).( A C BB ).( B C AA)

Term formed by ANDing of missing

Y ( A B CC ).( A C BB).( B C AA)

Standard POS form

Minterm: Each individual term in the standard

Maxterm: Each individual term in the standard

Each minterm is represented by mi where

Variables Minterms Maxterms

Y ABC ABC ABC ABC Logical Expression

where denotes sum of products

Y ( A B C ).( A B C ).( A B C ) Logical Expression

where denotes product of sum

The relationship between the expressions

We can exploit this complementary

For example, if a SOP expression for 4 variable

Then we can get the equivalent POS

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

1. Convert the given expression into standard

2. Convert the given expression into standard

In the algebraic method of simplification, we

Thus K-map is another simplification

It overcomes all the disadvantages of algebraic

The information contained in a truth table or

K-map Structure - 2 Variable

K-map Structure - 2 Variable

ABC ABC ABC 10 ABC ABC

1 ABC ABC ABC ABC

00 ABCD ABCD ABCD ABCD 00 ABCD ABCD ABCD ABCD

01 ABCD ABCD ABCD ABCD 01 ABCD ABCD ABCD ABCD

11 ABCD ABCD ABCD ABCD 11 ABCD ABCD ABCD ABCD

10 ABCD ABCD ABCD ABCD 10 ABCD ABCD ABCD ABCD

11 m3 m7 m15 m11 11 m12 m13 m15 m14

10 m2 m6 m11 m10 10 m8 m9 m11 m10

8/29/2017 ABC ABC 38

Once we plot the logic function or truth table

If we group the adjacent 1s then the result of

While grouping, we should group most

A pair eliminates 1 variable

A Quad eliminates 2 variable

A Quad eliminates 2 variable