Scribd
Upload
72 views8 pages

De Morgan's Theorem: Verify It Using Truth Tables. Similarly

1. De Morgan's theorem states that A + B is equivalent to A.B and A.B is equivalent to A + B. It can be generalized to more than two variables. 2. A logic circuit with three inputs A, B, C can be designed such that the output F=1 only when a majority of the inputs is 1 using a sum of products form. 3. Boolean functions can be simplified using theorems of Boolean algebra, leading to simpler logic circuit implementations with fewer gates. NAND and NOR gates are universal in that any function can be implemented using only one of these gate types.

Uploaded by

Alvin Jan Yap
Copyright
© © All Rights Reserved
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
72 views8 pages

De Morgan's Theorem: Verify It Using Truth Tables. Similarly

1. De Morgan's theorem states that A + B is equivalent to A.B and A.B is equivalent to A + B. It can be generalized to more than two variables. 2. A logic circuit with three inputs A, B, C can be designed such that the output F=1 only when a majority of the inputs is 1 using a sum of products form. 3. Boolean functions can be simplified using theorems of Boolean algebra, leading to simpler logic circuit implementations with fewer gates. NAND and NOR gates are universal in that any function can be implemented using only one of these gate types.

Uploaded by

Alvin Jan Yap
Copyright
© © All Rights Reserved
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/ 8

De Morgans theorem

A . B = A + B
A + B = A . B
Thus, is equivalent to
Verify it using truth tables. Similarly,
is equivalent to
These can be generalized to more than two
variables: to
A. B. C = A + B + C
A + B + C = A . B . C
Synthesis of logic circuits
Many problems of logic design can be specified using a
truth table. Give such a table, can you design the logic
circuit?
Design a logic circuit with three inputs A, B, C and one
output F such that F=1 only when a majority of the inputs is
equal to 1.
A B C F Sum of product form
0 0 0 0 F = A.B.C + A.B.C + A.B.C + A.B.C
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 Draw a logic circuit to generate F
Simplification of Boolean functions
Using the theorems of Boolean Algebra, the algebraic
forms of functions can often be simplified, which leads to
simpler (and cheaper) implementations.
Example 1
F = A.B + A.B + B.C
= A. (B + B) + B.C How many gates do you save
= A.1 + B.C from this simplification?
= A + B.C
A A
B F
B F C
C
Example 2
F = A.B.C + A.B.C + A.B.C + A.B.C
= A.B.C + A.B.C + A.B.C + A.B.C + A.B.C + A.B.C
= (A.B.C + A.B.C) + (A.B.C + A.B.C) + (A.B.C + A.B.C)
= (A + A). B.C + (B + B). C.A + (C + C). A.B
= B.C + C.A + A.B
Example 3 Show that A + A.B = A
A + AB
= A.1 + A.B
= A. (1 + B)
= A. 1
= A
Other types of gates
A A
A.B B A+B
B
NAND gate NOR gate
Be familiar with the truth tables of these gates.
A
B A + B = A.B + A.B
Exclusive OR (XOR) gate
NAND and NOR are universal gates
Any function can be implemented using only NAND
or only NOR gates. How can we prove this?
(Proof for NAND gates) Any boolean function
can be implemented using AND, OR and NOT gates.
So if AND, OR and NOT gates can be implemented
using NAND gates only, then we prove our point.
1. Implement NOT using NAND
A A
2. Implementation of AND using NAND
A A.B
B A
1. Implementation of OR using NAND
A A
A.B = A+B
B
B

Exercise. Prove that NOR is a universal gate.

You might also like