6 Canonical Form
Uploaded by
Balaji kv6 Canonical Form
Uploaded by
Balaji kvCanonical Form
Minterms
Binary variable: 𝑥 𝑥 Normal Form
𝑥 , 𝑥′ Complement Form
Possible input combinations: 𝑥 ′ 𝑦 ′ , 𝑥 ′ 𝑦, 𝑥𝑦 ′ , 𝑥𝑦
Minterm / Standard product N variables 2𝑁 minterms
Minterms are AND terms with
every variable present in
either true or complemented
form.
Maxterms
Maxterms are OR terms with every variable present in either true or complemented form.
Each Maxterms are complement of its corresponding minterms ,and vice versa.
mj = Mj and Mj = mj
N variables 2𝑁 maxterms
Symbol for maxterm Mj
Maxterm / Standard sum
Canonical form – Boolean Function
Complement of f1’
Property of Boolean Algebra
• Any Boolean expression can be expressed as a sum of minterms / ORing of
minterms/ Sum of Products
• Any Boolean expression can be expressed as a Product of maxterms /
ANDing of maxterms/ Product of Sums
• sum of minterms and Product of maxterms are said to be Canonical
forms.
Canonical forms of Boolean expression.
1.Sum of Products form (SOP)/Sum of Minterms(SOM)
2.Product of Sums form (POS)/Product of Maxterms(POM)
Determination of Boolean expression from the truth table
• ‘SOP’ form is obtained by "ORing" the minterms
corresponding to "1" entries in the truth table
• ‘POS’ form is obtained by "ANDing" the maxterms
corresponding to "0" entries in the function table
Sum of Minterms
Sum of minterms: Sum of Product terms
Express the Boolean function, F = A + B’C as sum of minterms. F= A + B’C
B,C A
Variables in the function: A, B, C
First term: A = A(1)(1) = A(B+B’)(C+C’) = (AB + AB’)(C+C’) = ABC + ABC’ + AB’C + AB’C’
Second term: B’C = B’C(A+A’) = AB’C + A’B’C
F = ABC + ABC’ + AB’C + AB’C’ + AB’C + A’B’C
F = 111+110+101+100+001
Product of Maxterms
Product of maxterms: Product of Sum terms
Express the Boolean function, F = xy + x’z as product of maxterms.
Variables in the function: x, y, z
F = xy+x’z = (xy+x’)(xy+z) A+BC = (A+B)(A+C)
= (x’+x)(x’+y)(x+z)(y+z)
= (x’+y) (x+z) (y+z)
Each OR term should have three variables.
= (x’+y+0) (x+0+z) (0+y+z)
Missing variables replaced by in the place of 0.
= (x’+y+zz’) (x+yy’+z) (xx’+y+z)
F = (x’+y+z) (x’+y+z’) (x+y+z) (x+y’+z) (x+y+z) (x’+y+z)
F = (x’+y+z) (x’+y+z’) (x+y+z) (x+y’+z)
F = (1+0+0) (1+0+1) (0+1+0) (0+0+0) = M0 M2 M4 M5
F (x,y,z) = (0,2,4,5) = 𝑀(0,2,4,5)
Conversion between Canonical forms
Relation between SOP and POS
mj = Mj and Mj = mj
𝐹 𝐴, 𝐵, 𝐶 = 𝑚(1,4,5,6,7)
𝐶𝑜𝑚𝑝𝑙𝑒𝑚𝑒𝑛𝑡, 𝐹 ′ 𝐴, 𝐵, 𝐶 = 𝑚 0,2,3 = 𝑚0 + 𝑚2 + 𝑚3
𝑇𝑎𝑘𝑖𝑛𝑔 𝐶𝑜𝑚𝑝𝑙𝑒𝑚𝑒𝑛𝑡 𝑏𝑦 𝐷𝑒𝑀𝑜𝑟𝑔𝑎𝑛𝑠 𝑇𝑒𝑜𝑟𝑒𝑚
𝐹 𝐴, 𝐵, 𝐶 = (𝑚0 + 𝑚2 + 𝑚3 )’= 𝑚0′ . 𝑚2′ . 𝑚3′
= M0.M2.M3
= 𝑀(0,2,3)
𝑇𝑒 𝑡𝑜𝑡𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑚𝑖𝑛𝑡𝑒𝑟𝑚𝑠 𝑜𝑟 𝑚𝑎𝑥𝑡𝑒𝑟𝑚𝑠 𝑖𝑠 2𝑛 ,
𝑤𝑒𝑟𝑒 𝑛 𝑖𝑠 𝑡𝑒 𝑡𝑜𝑡𝑎𝑙 𝑏𝑖𝑛𝑎𝑟𝑦 𝑣𝑎𝑟𝑖𝑎𝑏𝑙𝑒𝑠 𝑖𝑛 𝑡𝑒 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛.
Example
Determine the SOP form of the following function.
F =xy+x’z
Using Truth Table
x y z F
0 0 0 0 In SOM form,
𝐹 𝐴, 𝐵, 𝐶 = = 𝑚(1,3,6,7)
0 0 1 1
0 1 0 0
0 1 1 1 𝑆𝑖𝑛𝑐𝑒 𝑡𝑟𝑒𝑒 𝑣𝑎𝑟𝑖𝑎𝑏𝑙𝑒𝑠 are present,
total no of minterms = 8
1 0 0 0
Missing terms: 0,2,4,5
1 0 1 0
1 1 0 1
1 1 1 1 In POM form,
𝐹 𝐴, 𝐵, 𝐶 = = 𝑀(0,2,4,5)
Standard Forms (NOT Unique)
• Canonical form – obtained from the reading of
truth table
• Rarely used with the least number of literals
• Standard Forms: The terms may contain one,
two or any number of literals
• Types of standard forms:
1.Standard Sum of Products(SOP)
2.Standard Product of Sums (POS)
Standard Sum of Products
ORing /sum of product terms, of one or more literals each
Example: 𝐹1 = 𝑦 ′ + 𝑥𝑦 + 𝑥 ′ 𝑦𝑧 ′
Standard Product of Sums
ANDing of product terms which has one or more literals each
Example: 𝐹2 = 𝑥(𝑦 ′ + 𝑧)(𝑥 + 𝑦 + 𝑧 ′ )
Non Standard form
Neither in sum of product(SOP) form nor in Product of
sums(POS) form
Example: 𝐹3 = 𝐴𝐵 + 𝐶 𝐷 + 𝐸
(three level implementation required)
Can convert to standard form by using distributive law
𝐹3 = 𝐴𝐵 + 𝐶𝐷 + 𝐷𝐸
Can be implemented by two level implementation which
produces least delay between the gates
Example
Convert the following into other canonical form
𝐹 𝐴, 𝐵, 𝐶 = 𝑚(1,4,7)
In SOP form,
𝐹 𝐴, 𝐵, 𝐶 = = 𝑚(1,4,7)
Missing terms: 0,2,3,5,6
In POS form,
𝑭 𝑨, 𝑩, 𝑪 = 𝑴(𝟎, 𝟐, 𝟑, 𝟓, 𝟔)
𝐹 𝑤, 𝑥, 𝑦, 𝑧 = 𝑀 0,1,2,3,4,6,12
In POS form,
𝐹 𝑤, 𝑥, 𝑦, 𝑧 = 𝑀 0,1,2,3,4,6,12
Since 4 variables expression ,16 maxterms are possible
Missing terms: 5,7,8,9,10,11,13,14,15
In POS form,
𝑭 𝒘, 𝒙, 𝒚, 𝒛 = 𝒎(5,7,8,9,10,11,13,14,15 )
Example
* Convert the given Boolean expression into canonical SOP form
𝑌 = 𝐴𝐶 + 𝐴𝐵 + 𝐵𝐶
𝑌 = 𝐴𝐶. 1 + 𝐴𝐵. 1 + 𝐵𝐶. 1 = 𝐴𝐶. 𝐵 + 𝐵′ + 𝐴𝐵. 𝐶 + 𝐶 ′ + 𝐴 + 𝐴′ . 𝐵𝐶
= 𝐴𝐵𝐶 + 𝐴𝐵′ 𝐶 + 𝐴𝐵𝐶 + 𝐴𝐵𝐶′ + 𝐴𝐵𝐶 + 𝐴′ 𝐵𝐶
Y = 𝐴𝐵𝐶 + 𝐴𝐵′ 𝐶 + 𝐴𝐵𝐶 ′ + 𝐴′ 𝐵𝐶
= 𝑚3 + 𝑚5 + 𝑚6 + 𝑚7 = (3,5,6,7)
* Convert the given Boolean expression into canonical SOP form
F = x’+x(x+y’)(y+z’)
= x’+* x(x+y’)(y+z’)+ 𝑎 + 𝑏𝑐𝑑 = (𝑎 + 𝑏)(𝑎 + 𝑐)(𝑎 + 𝑑)
F = (x’+x)(x’+x+y’)(x’+y+z’)
F = (1)(1+y’)(x’+y+z’) = (1+y’)(x’+y+z’)
=(1)(x’+y+z’) = x’+y+z’ F= M5 = 𝑀(5) 𝑌 = 𝑀(101)
Example
* Convert the given Boolean expression into canonical POS form
𝑌 = 𝐴(𝐴 + 𝐵)(𝐴 + 𝐵 + 𝐶)
𝑌 = 𝐴+0+0 𝐴+𝐵+0 𝐴+𝐵+𝐶
= 𝐴 + 𝐵𝐵 + 𝐶𝐶 A + B + C𝐶 ( 𝐴 + 𝐵 + 𝐶)
𝑌 = 𝐴+𝐵+𝐶 𝐴+𝐵+𝐶 𝐴+𝐵+𝐶 𝐴+𝐵+𝐶 𝐴+𝐵+𝐶 A + B + C ( 𝐴 + 𝐵 + 𝐶)
𝒀= 𝑨+𝑩+𝑪 𝑨+𝑩+𝑪 𝑨+𝑩+𝑪 𝑨+𝑩+𝑪 = 𝟎, 𝟏, 𝟐, 𝟑 .
* Simplify the following Boolean expression
𝑦(𝑎, 𝑏, 𝑐) = 𝑚(1,3,5,7)
𝑦= 𝑚(1,3,5,7) = 𝑎 𝑏 𝑐 + 𝑎 𝑏 𝑐 + 𝑎 𝑏 c + a b c
= 𝑎 𝑐(𝑏 + 𝑏 ) + 𝑎 c ( 𝑏+ b)
= 𝑎 𝑐 + 𝑎 c =c ( 𝑎+a)
y=c
Example
* Simplify the following Boolean expression
𝑌 = 𝑀(3,5,7)
𝑌 =(A+B’+C’)(A’+B+C’)(A’+B’+C’)
𝑌 =(AA’+A’B’+A’C’+AB+BB’+BC’+AC’+B’C’+C’C’) ( A’+B’+C’)
𝑌 =(A’B’+A’C’+AB+BC’+AC’+B’C’) ( A’+B’+C’)
𝑌 = A’A’B’+A’A’C’+A’AB+A’BC’+A’AC’+A’B’C’+A’B’B’+A’B’C’+AB’B+B’BC’+AB’C’
+B’B’C’+ A’B’C’+A’C’C’+ABC’+BC’C’+AC’C’+B’C’C’
𝑌 = A’ B’+A’C’+A’BC’+A’B’C’+A’ B’+A’B’C’+AB’C’+B’C’+
A’B’C’+A’C’+ABC’+BC’+AC’+B’C’
𝑌 = A’ B’+A’C’+BC’+AC’+B’C’ =A’B’+C’(A+A’)+C’(B+B’)
𝑌 = A’ B’+C’
𝐴𝑙𝑡𝑒𝑟𝑛𝑎𝑡𝑖𝑣𝑒𝑙𝑦 𝐶𝑜𝑛𝑣𝑒𝑟𝑡 𝑃𝑂𝑆 𝑓𝑜𝑟𝑚 𝑡𝑜 𝑆𝑂𝑃 𝑓𝑜𝑟𝑚 𝑏𝑦 𝑐𝑜𝑚𝑝𝑙𝑒𝑚𝑒𝑡 𝑝𝑟𝑜𝑝𝑒𝑟𝑡𝑦 ,
𝑡𝑒𝑛 𝑆𝑖𝑚𝑝𝑙𝑖𝑓𝑖𝑐𝑎𝑡𝑖𝑜𝑛 𝑐𝑎𝑛 𝑏𝑒 𝑑𝑜𝑛𝑒.
𝑌 = 𝑀(3,5,7),Expression in SOP form Y = 𝑚(0,1,2,4,5,6)
Y = A′ B ′ C ′ + A′ B ′ C + A′ BC′+AB’C’+AB’C+ABC’ = A’B’+C’