De Morgan's Theorems
De Morgan has suggested two theorems which are extremely useful in Boolean Algebra. The two theorems are discussed below.
Theorem 1:
FIG.1: Implementation of De Morgan's first theorem.
Table1: Verification of De Morgan’s first theorem.
Verification of De Morgan’s first theorem practically:
Fig.2: Connection diagram to prove De Morgan’s first theorem.
Observation table for Verification of De Morgan’s first theorem:
Table2: Observation table for verification of De Morgan’s first theorem
Theorem 2:
FIG.1: Implementation of De Morgan's Second theorem.
Truth Table showing verification of the De Morgan's first theorem :
Table1: Verification of De Morgan’s first theorem
Verification of De Morgan’s first theorem practically:
Fig.2: Connection diagram to prove De Morgan’s Second theorem.
Observation table for Verification of De Morgan’s Second theorem:
Table2: Observation table for verification of De Morgan’s first theorem.
Applications of De Morgan’s Theorem:
1) It can be used for simplification of logical expressions.
Ex:
And if we simplify expression using De Morgan’s theorem and implemented simplified expression Y = ABthen we will require only 3 logic gates as shown below:
2) Thus Minimization of logic circuit using De Morgan’s theorem.
3) Reduction of the circuit cost as number of gates are reduced.
E & TC Department
Pimpri Chinchwad Polytechnic