We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7
Lecture: 5
SoP & PoS
CANONICAL OR STANDARD FORMS: There are two ways to represent Boolean function, one is standard (canonical) Sum Of Product form, and another is the standard Product Of Sum.
SUM OF PRODUCT : =a.b +c.d(SOP)
It is an expression in which one or more product terms are logically added. Sum of Product is also known as Product of Minterms. Minterms and Maxterms are complement each other. SUM OF PRODUCT : (SOP) Min terms: Sum Of Product is also known as Minterms. Each minterm obtained from an AND term of the n variable, with each variable being primed/not if the bit of binary number is 0 and unprimed if a 1. Symbol of minterm is mj where j=0,1,2,… The three variable Minterms are shown in the table. Min terms: Input Min Terms Min Term X Y Z (Standard Product Terms) Designation 00 0 X’ Y’ Z’ m0 00 1 X’ Y’ Z m1 01 0 X’ Y Z’ m2 01 1 X’ Y Z m3 10 0 X Y’ Z’ m4 10 1 X Y’ Z m5 11 0 X Y Z’ m6 11 1 XYZ m7 CANONICAL OR STANDARD FORMS: PRODUCT OF SUM: (POS)=(a+b).(c+d) It is an expression in which one or more product terms are logically multiplied. Product Of Sum is also known as Product of Maxterms. Minterms and Maxterms are complement each other. PRODUCT OF SUM: (POS) Max terms: Product Of Sum is also known as Maxterms. Each maxterm obtained from an OR term of the n variable, with each variable being primed if the bit of binary number is 1 and unprimed if a 0. Symbol of maxterm is Mj where j=0,1,2,… The three variable Minterms are shown in the table. Max terms: Input Max Terms Max Term X Y Z (Standard Product Terms) Designation 00 0 X+Y+Z M0 00 1 X+Y+Z’ M1 01 0 X+Y’+Z M2 01 1 X+Y’+Z’ M3 10 0 X’+Y+Z M4 10 1 X’+Y+Z’ M5 11 0 X’+Y’+Z M6 11 1 X’+Y’+Z’ M7