CM305.5 to 6E
-
Upload
scribd9885343478 -
Category
Documents
-
view
219 -
download
0
Transcript of CM305.5 to 6E
-
8/11/2019 CM305.5 to 6E
1/24
Name : P. Srinivasa Baba
Designation : Lecturer in ECE
Branch : Electronics & Comm. Engg.
Institute : Govt. Polytechnic for women, Guntur
Year/ Semester : IIISubject : Digital Electronics
Subject Code : CM-305
Topic : Logic gates & Boolean Algebra
Duration : 100 mts.
Sub topic : De Morgans theorems and
minimization of Boolean expressions
Teaching aids : Diagrams
DEPARTMENT OF TECHNICAL EDUCATION
ANDHRAPRADESH
1CM305.5 to 6
-
8/11/2019 CM305.5 to 6E
2/24
Recap
1. List of Boolean postulates
2. Boolean definitions3. Principles of duality
CM305.5 to 6
-
8/11/2019 CM305.5 to 6E
3/24
CM305.5 to 6 3
Objectives
On completion of this period, you would be able
to
State De Morganstheorems
Know Minimization of Boolean expressionsusing
Boolean postulates
-
8/11/2019 CM305.5 to 6E
4/24
CM305.5 to 6 4
DeMorgan s laws
A mathematician named DeMorgandeveloped a pair of
Important rules regarding group complementation in
Boolean algebra .
These two laws are known as De Morgans laws
-
8/11/2019 CM305.5 to 6E
5/24
CM305.5 to 6 5
First Law
Complement of sumis equivalent to productof
individual complements
......C.B.A....CBA
B.ABA
or
-
8/11/2019 CM305.5 to 6E
6/24
CM305.5 to 6 6
Second Law
Complement of Productis equivalent to sumof
individual complements
......CBA.....C.B.A
BAB.A
or
-
8/11/2019 CM305.5 to 6E
7/24
CM305.5 to 6 7
-
8/11/2019 CM305.5 to 6E
8/24
CM305.5 to 6 8
De Morgan's theorem may be thought of in terms
of breakinga long bar symbol
-
8/11/2019 CM305.5 to 6E
9/24
CM305.5 to 6 9
Application of De Morgans theorems in simplification
of Boolean expressions
Example. 1 Simplify the following logic diagram
The above diagram can be simplified using De Morgans
first law
-
8/11/2019 CM305.5 to 6E
10/24
CM305.5 to 6 10
.
-
8/11/2019 CM305.5 to 6E
11/24
CM305.5 to 6 11
The simplified circuit
-
8/11/2019 CM305.5 to 6E
12/24
CM305.5 to 6 12
Wrong way to simplification
Do not break more than one bar at a time to conserve steps,
it often leads to an incorrect result, so don't do it!
-
8/11/2019 CM305.5 to 6E
13/24
CM305.5 to 6 13
Example. 2
.
..
-
8/11/2019 CM305.5 to 6E
14/24
CM305.5 to 6 14
Example. 3 Simplify the following circuit
-
8/11/2019 CM305.5 to 6E
15/24
CM305.5 to 6 15
.
.
-
8/11/2019 CM305.5 to 6E
16/24
CM305.5 to 6 16
The simplified circuit
-
8/11/2019 CM305.5 to 6E
17/24
CM305.5 to 6 17
Example. 4 Simplify the following circuit
-
8/11/2019 CM305.5 to 6E
18/24
CM305.5 to 6 18
-
8/11/2019 CM305.5 to 6E
19/24
-
8/11/2019 CM305.5 to 6E
20/24
CM-305.5 to 6 20
Example. 5 Simplify the following Boolean expression
ABC ABC ABC ABC
Solution: ABC ABC ABC ABC
ABC ABC AB(C C)
ABC ABC AB(1)
ABC ABC AB
ABC A(B BC)
ABC A(B C)
ABC AB AC
B(AC A) AC
B(A C) AC AB BC AC
-
8/11/2019 CM305.5 to 6E
21/24
-
8/11/2019 CM305.5 to 6E
22/24
CM305.5 to 6 22
Quiz
According to De Morgans theorem complement
of sum are equivalent to
1. Sum of individual complements
2. Product of individual complements
3. Sum of all individual variables
4. Dual of the given expression
F tl k d ti i E
-
8/11/2019 CM305.5 to 6E
23/24
CM305.5 to 6 23
Frequently asked questions in Exams
1. State and explain De Morgans theorems
2. Minimize the following expressions using De Morgans
theorems and Boolean postulates
DCBDBCAADCABDBAABCd)(
BACDABABCD(c)C)B(A.C)B(A(b)
CBAABCBCA(a)
A i t
-
8/11/2019 CM305.5 to 6E
24/24
CM305.5 to 6 24
Assignment
n Minimize the following expressions using De Morgans
theorems and Boolean postulates
DCBDCAADCABDBABCd)(
BACDABACD(c)
C)B(A.C)(B(b)
CBABCBCA(a)
+ 1
. ( A + A)