Scribd
Upload
76 views10 pages

Canonical Forms

The document discusses canonical forms for representing Boolean functions, including: - Sum-of-Minterms (SOM) representation, where a function is written as the sum of minterms corresponding to a 1 in the truth table. - Product-of-Maxterms (POM) representation, where a function is written as the product of maxterms corresponding to a 0 in the truth table. - Methods for obtaining the SOM and POM representations from a truth table and for converting between the two representations, including taking complements. - Notations for representing canonical forms concisely using minterm/maxterm indices.

Uploaded by

Nijhum Choudhury
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
76 views10 pages

Canonical Forms

The document discusses canonical forms for representing Boolean functions, including: - Sum-of-Minterms (SOM) representation, where a function is written as the sum of minterms corresponding to a 1 in the truth table. - Product-of-Maxterms (POM) representation, where a function is written as the product of maxterms corresponding to a 0 in the truth table. - Methods for obtaining the SOM and POM representations from a truth table and for converting between the two representations, including taking complements. - Notations for representing canonical forms concisely using minterm/maxterm indices.

Uploaded by

Nijhum Choudhury
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 10

Canonical Forms

Overview
 What are Canonical Forms?
 Minterms and Maxterms
 Index Representation of Minterms and Maxterms
 Sum-of-Minterm (SOM) Representations
 Product-of-Maxterm (POM) Representations
 Representation of Complements of Functions
 Conversions between Representations
Canonical Forms
 It is useful to specify Boolean functions in a form that:
 Allows comparison for equality.
 Has a correspondence to the truth tables
 Canonical Forms in common usage:
 Sum of Minterm (SOM) Example: F(A,B) =
A’B’+ A’B+AB’+ AB
 Product of Maxterm (POM) Example: F(A,B) =
(A+B).(A+B’).(A’+B)(A’+B’)
Obtaining SOM and POM from Truth Table
Here The function will be the
terms
where the Output value is
1.that is,
A’BC+AB’C+ABC’+ABC
If we want to obtain the POS
form of the function then
We have to take the value
where output is 0. And
Representing it in following
way-
(A+B+C).(A+B+C’).(A+B’+C).
(A’+B+C)

Minterms
 Minterms are AND terms with every variable present in
either true or complemented form.
 Given that each binary variable may appear normal (e.g.,
x) or complemented (e.g., ), there are 2n minterms for n
variables.
 Example: Two variables (X and Y)produce
2 x 2 = 4 combinations:
 (both normal)
 (X normal, Y complemented)
 (X complemented, Y normal)
 (both complemented)
 Thus there are four minterms of two variables.
Maxterms
 Maxterms are OR terms with every variable in true or
complemented form.
 Given that each binary variable may appear normal (e.g.,
x) or complemented (e.g., x), there are 2n maxterms for n
variables.
 Example: Two variables (X and Y) produce
2 x 2 = 4 combinations:
 (both normal)
 (x normal, y complemented)
 (x complemented, y normal)
 (both complemented)
Minterm and Maxterm
Minterm Maxterm

x y z Ter Designation Term Designation


m
m0 M0
0 0 0 x’y’z’ x+y+z
m1 M1
0 0 1 x’y’z x+y+z’
m2 M2
0 1 0 x’yz’ x+y’+z
m3 M3
0 1 1 x’yz x+y’+z’
m4 M4
1 0 0 xy’z’ x’+y+z
m5 M5
1 0 1 xy’z x’+y+z’
m6 M6
1 1 0 xyz’ x’+y’+z
m7 M7
1 1 1 xyz x’+y’+z’

Canonical Sum of Minterms


 Any Boolean function can be expressed as a Sum of
Minterms or Standard Sum of Products.
 For the function table, the minterms used are the
terms corresponding to the 1's
 For expressions, expand all terms first to explicitly list
all minterms. Do this by “ANDing” any term missing a
variable v with a term v+v’
 Example: Implement as a sum of
minterms.
 First expand terms: f = x(y+ ý )+ x́ ý
 Then distribute terms: f = xy+x ý + x́ ý
 Express as sum of minterms: f = m3 + m2 + m0
Another SOM Example
 Example: F = A + B C
 There are three variables, A, B, and C which we take to be
the standard order.
 Expanding the terms with missing variables:
 F = A(B + B’)(C + C’) + (A + A’) B’ C
= ABC + ABC’ + AB’C + AB’C’ + AB’C + A’B’C
= ABC + ABC’ + AB’C + AB’C’ + A’B’C
= m7 + m6 + m5 + m4 + m1 = m1 + m4 + m5 + m6 + m7
 Collect terms (removing all but one of duplicate
terms):
 Express as SOM:
Shorthand SOM Form
 From the previous example, we started with:
 We ended up with: F = m1+m4+m5+m6+m7
 This can be denoted in the formal shorthand:
F( A , B ,C )=Σ m (1,4,5,6,7 )

 Note that we explicitly show the standard variables


in order and drop the “m” designators.
Canonical Product of Maxterms
Any Boolean Function can be expressed as a Product of
Maxterms (POM).

 For the function table, the maxterms used are the


terms corresponding to the 0's.
 For an expression, expand all terms first to explicitly
list all maxterms. Do this by first applying the second
distributive law , “ORing” terms missing variable v
with a term equal to v. v́ and then applying the
distributive law again.
 Example: Convert to product of maxterms:
f ( x , y , z )  x  x y
Apply the distributive law: f (x, y,z)  x  x y
Add missing variable z: f (x, y,z)  x  x y
Express as POM: f = M2 · M3

Another POM Example


 Example: F = A + B C
 There are three variables, A, B, and C which we take to be
the standard order.
 Expanding the terms with missing variables:
 Collect terms (removing all but one of duplicate terms):
 Express as POM:
Shorthand SOM Form
 From the previous example, we started with:
 We ended up with: F = M0.M2.M3
 This can be denoted in the formal shorthand:
 F(A,B,C) = Π (0,2,3,6)
M

 Note that we explicitly show the standard variables in


order and drop the “M” designators.

Standard Forms
 A Simplification Example:
 F(A,B,C)= Σ(1,4,5,6,7)
 Writing the minterm expression:
 F = A’ B’ C + A B’ C’ + A B’ C + ABC’ + ABC
 Simplifying:
F = A’ B’ C + A B’ (C+C’) +AB(C+C’)
= A’ B’ C + A B’ .1+AB.1
= A’ B’ C + A(B+B’)
= A’ B’ C + A
= B’C + A
AND/OR Two-level Implementation of SOP
Expression
The two implementations for F are shown below – it is quite
apparent which is simpler!
A
B
C
A
B
C
A
B F
C
A
B A
C F
A
B
C B
C

Function Complement
 The complement of a function expressed as a sum of
minterms is constructed by selecting the minterms missing
in the sum-of-minterms canonical forms.
 Alternatively, the complement of a function expressed by
a Sum of Minterms form is simply the Product of
Maxterms with the same indices.
 Example: Given F(X,Y,Z) = m(1,3,5,7)
Conversion Between Forms
 To convert between sum-of-minterms and product-of-maxterms
form (or vice-versa) we follow these steps:
 Find the function complement by swapping terms in the list
with terms not in the list.
 Change from products to sums, or vice versa.
F( x , y , z)=Σ m (1,3,5,7)

 Example: Given F as before:


 Form the Complement:
F(x,y,z) m(0,2,4,6)
 Then use the other form with the same indices – this
forms the complement again, giving the other form of the
original function: F( x , y , z)=Π M (0,2,4,6)
Convert Minterm to Maxterm
 Example : F(X,Y,Z) = m(1,3,5,7)
 F = m1+m3+m5+m7
= x’y’z+x’yz+xy’z’+ xyz
 Find F́ : F(X,Y,Z) = m(1,3,5,7)
 F́ = x’y’z’+ x’yz’+xy’z’+xyz’
 Complement F́ to get F
F́=F=¿ x’y’z’+ x’ yz ´’+ xy’z’+xyz’ 

F(x,y,z) = Π M(0,2,3,6)
Standard Forms
 Standard Sum-of-Products (SOP) form: equations are written as an OR of AND terms
 Standard Product-of-Sums (POS) form: equations are written as an AND of OR terms

You might also like