Scribd
Upload
237 views11 pages

Canonical Form (Sum of Product) : Faculty: S.Pandikumar

Canonical form (Sum of Product) - There are two canonical forms for Boolean expressions derived from truth tables: sum of products (SOP) and product of sums (POS) - SOP represents the function's 1s (on-set) as a sum of AND terms, called minterms - POS represents the function's 0s (off-set) as a product of OR terms, called maxterms - SOP performs an OR operation on AND terms, while POS performs an AND operation on OR terms - Conversion between SOP and POS involves identifying complementary locations and changing minterms to maxterms or vice versa

Uploaded by

20COS230 T.RAGUL
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
237 views11 pages

Canonical Form (Sum of Product) : Faculty: S.Pandikumar

Canonical form (Sum of Product) - There are two canonical forms for Boolean expressions derived from truth tables: sum of products (SOP) and product of sums (POS) - SOP represents the function's 1s (on-set) as a sum of AND terms, called minterms - POS represents the function's 0s (off-set) as a product of OR terms, called maxterms - SOP performs an OR operation on AND terms, while POS performs an AND operation on OR terms - Conversion between SOP and POS involves identifying complementary locations and changing minterms to maxterms or vice versa

Uploaded by

20COS230 T.RAGUL
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 11

Canonical form (Sum of Product)

Faculty: S.Pandikumar
Canonical form 1
• A canonical form specifies a unique
representation of the Boolean function
• There are two canonical forms for Boolean
expressions that derived from the truth table
– Sum of the Products (SOP)
– Product of the Sums (POS)
• SOP
– Represent the function’s 1s (on-set)
called Sum of Products (SOP) form
• POS
– Represent the function’s 0s (off-set) called Product
of Sums (POS) form
2
Canonical Form1
• SOP- Value 1 is considered, value 0
take complement
• POS- value 0 is considered, value 1 take
complement
Sum of SOP Product MIN TERM
products Term

Product of sum POS Sum MAX TERM


Term

3
Sum of products (SOP)
• Also called sum of minterms.
• It performs OR of AND terms.
x y z Minterm Maxterm
0 0 0 x’y’z’ = m0 x+y+z = M0
0 0 1 x’y’z = m1 x+y+z’ = M1
0 1 0 x’yz’ = m2 x+y’+z = M2
0 1 1 x’yz = m3 x+y’+z’= M3
1 0 0 xy’z’ = m4 x’+y+z = M4
1 0 1 xy’z = m5 x’+y+z’ = M5
1 1 0 xyz’ = m6 x’+y’+z = M6
1 1 1 xyz = m7 x’+y’+z’ = M7
4
SOP cont..
• The fundamental products are performs AND
operation on the variable.
• The fundamental products are also called
minterms. For example

5
6
Sum-of-Products Equation

Truth Table

7
Logical Diagram

8
Product of Sum
• You identify the fundamental sums needed
for a logic design.
• ANDing these sums, you get the product-of-
sums equation corresponding to the truth
table
• The function takes the value is ‘0’
• Example

9
1
Conversion between SOP
and POS
• identifying complementary locations,
• changing mintenn to maxtenn or reverse, and
finally
• changing summation by product or reverse.

F(A,B,C) =  m(3,4,5,6,7) =  M(0,1,2)


SOP POS

F'(A,B,C) =  m(0,1,2) =  M(3,4,5,6,7)


1

You might also like