DLD - Lecture - 08

Digital Logic & Design
Lecture 08
Standard Forms of
Boolean Expressions
 Sum-of-Products (SOP) Form
 Product-of-sums (POS) form
 Canonical forms
 There are two types of canonical forms:
 Sum-of-min terms or Canonical SOP
 Product-of-max terms or Canonical POS
Standard Forms of
Boolean Expressions
 Standard product terms or min terms
 Four Boolean product terms by combining
two variables x and y with logical AND
operation.
 The min terms are x’y’, x’y, xy’ and xy.
Standard Forms of
Boolean Expressions
 Standard sum terms or Max terms
 Four Boolean sum terms by combining two
variables x and y with logical OR
operation.
 The min terms are x + y, x + y’, x’ + y and
x’ + y’.
Standard Forms of
Boolean Expressions
 The following table shows the
representation of min terms and MAX
terms for 2 variables.
x y Min terms Max terms
0 0 m0=x’y’ M0=x + y
0 1 m1=x’y M1=x + y’
1 0 m2=xy’ M2=x’ + y
1 1 m3=xy M3=x’ + y’
Standard Forms of
Boolean Expressions
 If the binary variable is ‘0’, then it is represented
as complement of variable in min term and as
the variable itself in Max term.
 Similarly, if the binary variable is ‘1’, then it is
represented as complement of variable in Max
term and as the variable itself in min term.
 If there are ‘n’ Boolean variables, then there will
be 2n min terms and 2n Max terms.
Canonical SOP and POS
form
 Canonical SOP or POS form has all the
variables in all the terms
 A non-canonical SOP is converted into
canonical SOP by using the rule A  A 1
 A non-canonical POS is converted into
canonical POS by using the rule A A  0
Standard Forms (NOT Unique)
• Standard forms are “like” canonical forms,
except that not all variables need appear in
the individual product (SOP) or sum (POS)
terms.
• Example:
f1(a,b,c) = a’b’c + bc’ + ac’
is a standard sum-of-products form
• f1(a,b,c) = (a+b+c)•(b’+c’)•(a’+c’)
is a standard product-of-sums form.
2024.08.13 Boolean Algebra PJF - 8

Conversion of SOP from standard to
canonical form
• Expand non-canonical terms by inserting
equivalent of 1 in each missing variable x:
(x + x’) = 1
• Remove duplicate minterms
• f1(a,b,c) = a’b’c + bc’ + ac’
= a’b’c + (a+a’)bc’ + a(b+b’)c’
= a’b’c + abc’ + a’bc’ + abc’ + ab’c’
= a’b’c + abc’ + a’bc + ab’c’

Conversion of POS from standard to
canonical form
• Expand noncanonical terms by adding 0 in terms of
missing variables (e.g., xx’ = 0) and using the
distributive law
• Remove duplicate maxterms
• f1(a,b,c) = (a+b+c)•(b’+c’)•(a’+c’)
= (a+b+c)•(aa’+b’+c’)•(a’+bb’+c’)
= (a+b+c)•(a+b’+c’)•(a’+b’+c’)•
(a’+b+c’)•(a’+b’+c’)
= (a+b+c)•(a+b’+c’)•(a’+b’+c’)•(a’+b+c’)

Canonical SOP form
A C  BC
 A C(B  B)  ( A  A )BC
 ABC  ABC  ABC  ABC

 ABC  ABC  ABC
Canonical POS form
( A  B  C)( A  B  D)( A  B  C  D)
( A  B  C  D)( A  B  C  D)
( A  B  C  D)( A  B  C  D)( A  B  C  D)
Why Canonical SOP and
POS forms?
 Minimal Circuit implementation by
switching between Canonical SOP or POS
 Alternate Mapping method for
simplification of expressions
 PLD based function implementation
Minterms and Maxterms
 Minterms: Product terms in Canonical
SOP form
 Maxterms: Sum terms in Canonical POS
form
 Binary representation of Canonical SOP
product terms
 Binary representation of Canonical POS
sum terms
Minterms and Maxterms &
Binary representations
A B C Min- Max-
terms terms
0 0 0 A.B.C A B C
0 0 1 A.B.C A B C
0 1 0 A.B.C A B C
0 1 1 A.B.C A B C
1 0 0 A.B.C A B C
1 0 1 A.B.C A  B  C
1 1 0 A.B.C A  B  C
1 1 1 A.B.C A  B  C
SOP-POS Conversion
 Minterm values present in SOP expression
not present in corresponding POS
expression
 Maxterm values present in POS
expression not present in corresponding
SOP expression
SOP-POS Conversion
 Canonical Sum  A ,B,C (0,2,3,5,7)
A BC  ABC  ABC  A BC  ABC
 Canonical Product  A ,B,C (1,4,6)
(A  B  C)(A  B  C)(A  B  C)
  A ,B,C (0,2,3,5,7) =  A ,B,C (1,4,6)

Boolean Expressions and
Truth Tables
 Canonical SOP & POS expressions
converted to truth table form
 Canonical SOP & POS expressions
determined from truth table
SOP-Truth Table
Conversion
AB  BC
 A ,B,C (3,4,5,7)  ABC  ABC  ABC  ABC
Input Output
A B C F
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 1
POS-Truth Table
Conversion
 (1,2,3,5)
( A  B)(B  C) A ,B ,C
( A  B  C)( A  B  C)( A  B  C)( A  B  C)

Input Output
A B C F
0 0 0 1
0 0 1 0
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 1
Karnaugh Map
 Simplification of Boolean Expressions
 Doesn’t guarantee simplest form of
expression
 Terms are not obvious
 Skills of applying rules and laws
 K-map provides a systematic method
 An array of cells
 Used for simplifying 2, 3, 4 and 5 variable
expressions
3-Variable K-map
 Used for simplifying 3-variable
expressions
 K-map has 8 cells representing the 8
minterms and 8 maxterms
 K-map can be represented in row format
or column format
4-Variable K-map
 Used for simplifying 4-variable
expressions
 K-map has 16 cells representing the 16
minterms and 8 maxterms
 A 4-variable K-map has a square format

DLD - Lecture - 08

Uploaded by

DLD - Lecture - 08

Uploaded by

Digital Logic & Design

2024.08.13 Boolean Algebra PJF - 8

2024.08.13 Boolean Algebra PJF - 9

2024.08.13 Boolean Algebra PJF - 10

 ABC  ABC  ABC  ABC

  A ,B,C (0,2,3,5,7) =  A ,B,C (1,4,6)

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

You might also like