Scribd
Upload
11 views20 pages

Lecture-9

Uploaded by

abmateen541
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
11 views20 pages

Lecture-9

Uploaded by

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

Digital Logic Design

Lecture-10
Canonical and Standard Forms
• Minterms; ANDed Terms; Products; Sum of Products (SOPs)
• Maxterms; ORed Terms; Sums; Product of Sums(SOPs)
Minterms
• A binary variable ‘x’ may appear in the form of x and in the form of
complement
• If we have two variables x and y, there exists four AND terms

x y AND terms
0 0
0 1
1 0 x
1 1 xy
Minterms
• If we have three binary variable, there are 8 ANDterms, means 8
minterms.
Decimal x y z Minterm
0 0 0 0
1 0 0 1
2 0 1 0
3 0 1 1
4 1 0 0
5 1 0 1
6 1 1 0
7 1 1 1 xyz
Boolean Expression Using Minterms
• A Boolean expression can be expressed from a given truthtable by
forming minterms for each combination of variable that produces 1
and then taking OR of all those terms.
• Example1: Next Slide.
• Example2: Next Slide.
Boolean expression using truthtable
x y z
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 1
Boolean expression using truthtable
x y z
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 1
Example3: Boolean Expression as a
SOP
• F= A+
• There are 3 variables in this function, it means there must be three
literals in each minterm.
• There are two ways to solve this question.
• 1- by making truthtable and ORing all 1’s minterms
• 2- by completing literals for each minterm.
By making truth table and ORing

Decimal A B C F= A+
0 0 0 0 1 0 0
1 0 0 1 1 1 1
2 0 1 0 0 0 0
3 0 1 1 0 0 0
4 1 0 0 1 0 1
5 1 0 1 1 1 1
6 1 1 0 0 0 1
7 1 1 1 0 0 1
By making truth table and ORing
• There are total 4 combinations of variable, where function value is 1
and these are the minterms and we have to OR these four.
by completing literals for each
minterm.
• See board…
Maxterms
• 0 as its
• 1 as a complement
• A Boolean function can be made form a truthtable by forming
maxterms for each combination having 0 in function and ANDing all
terms.
Maxterms
Decimal x y z Maxterms
0 0 0 0
1 0 0 1
2 0 1 0
3 0 1 1
4 1 0 0
5 1 0 1
6 1 1 0
7 1 1 1
Boolean Expression making using
Truthtable
x y z F
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 1
Boolean Expression making using
Truthtable
x y z F
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 1
Boolean Expression as a POS
• F=
• There are 3 variables in this fuction, it means there must be three
literals in each maxterm.
• There are two ways to solve this question.
• 1- by making truthtable and ANDing all 0’s maxterms
• 2- by completing literals for each maxterm.
By making truth table and ANDing
x y z xy F
0 0 0 0 1 0 0
0 0 1 0 1 1 1
0 1 0 0 1 0 0
0 1 1 0 1 1 1
1 0 0 0 0 0 0
1 0 1 0 0 0 0
1 1 0 1 0 0 1
1 1 1 1 0 0 1
By completing the literals
• See Board…
Conversions between canonical
forms
• See board…
Standard Type
• Two level structure of gates:
• POS
• SOP

You might also like