Laws and Rules

DeMorgan’s Theorem
Universal Gates
• At the end of this chapter, students should be able to:-
– Apply the basic laws and rules of Boolean algebra.
– Apply DeMorgan’s theorems to Boolean expressions.
– Evaluate Boolean expressions.
– Simplify expressions by using the laws and rules of Boolean
algebra.
– Draw the logic circuit using universal gates only.
– Derive the Sum-of-Products (SOP) and Product-of-Sums
(POS) from a truth table.
– Design a combinational logic circuits.

10/9/2012 2
 • Boolean Algebra is the mathematics of digital systems.
• A variable is a symbol used to represent a logical
quantity that have a value of 1 or 0.

• The complement is the inverse of a variable and is

indicated by a bar over the variable.

• Three laws of Boolean Algebra are:

Commutative Distributive

10/9/2012 RA/Sept2012-Jan2013 3
10/9/2012 RA/Sept2012-Jan2013 4
10/9/2012 RA/Sept2012-Jan2013 5
10/9/2012 RA/Sept2012-Jan2013 6
10/9/2012 8
 A. A  0
AB. AB  0
A.B. A  0.B  0
( A  B )( A  B )  0

A  A 1
AB  AB  1
A  B  A 1 B 1
( A  B)  ( A  B)  1
10/9/2012 9
 A A
AB  AB
( A  B)  A  B

(A  BC)  (A  B)(A  C)
A  BCD  ( A  B )( A  CD )
 ( A  B )( A  C )( A  D)

(A  AB)  A
A  AB  A(1  B )
 A.1
A

10/9/2012 10
 Example 1

Simplify Y  A  ABC
Solution: Y  A  ABC
 (A  A)(A  BC) Rule 10

 1(A  BC)
 A  BC
Example 2
Simplify Y  A  A.B  A.B.C
Solution: Y  A  A.B  A.B.C
 A  A.B(1  C) Rule 11

 A  A.B
AB Rule 10

10/9/2012 11
 Example 3

Prove that A.B.C  A.B.C  A.B.C  A.B  B.C

Solution: A.B.C  A.B.C  A.B.C
 A.B(C  C)  A.B.C Factorise A B Distributive Law

 A.B(1)  A.B.C
 A.B  A.B.C
 B.(A  AC)
 B(A  A)(A  C) * A  BC  (A  B)(A  C) Rule 10

 B(A  C)
 A.B  B.C

10/9/2012 12
 Example

Prove that the SOP and POS expressions for an OR gate are equivalent.

SOP, Y  AB  A B  AB
POS, Y = A + B

Solution: Y  A.B  A.B  AB

 A.B  A(B  B) Distributive Law
 A.B  A
 (A  A)(A  B) Rule 10
AB

10/9/2012 13
Solution:
10/9/2012 16
 Example 1 Example 2

Prove that AB.B  AB Prove that AB.B  C  BC

Solution: AB.B Solution: AB.B  C
 (A  B)B  (A  B)  BC
 AB  BB  A  B  C  BBC
 AB  0  A  B  C  BC
 AB  B  C(A  1)
Example 3  BC
Prove that AB.C  D. AB  A  B  C  D
Solution AB.C  D. AB
 A.B.C  D  AB Break the outer most bar
 AB  C  D  A  B
 A BC  D

10/9/2012 17
 • NAND and NOR gates are universal gates.
• It can represent basic gates which are NOT, AND and OR.

• The expression Y  A.A  A is equivalent to a NOT gate.

A
Y =

• The expression Y  AB  ABis equivalent to an AND gate.

A
B Y =

• The expression is Y  A.B  A  B  A  Bequivalent to the OR gate.

A

B
Y =

10/9/2012 18
 Example 1

Draw Y  AB  CD using only NAND gates.

1 Double invert the expression .

Y  AB  CD

2
Keep the top inversion bar. Apply DeMorgan’s Theorem 2 to the bottom inversion
bar to eliminate the OR operation.

Y  AB  CD

3 Draw the circuit using only NAND gates.

A
B
Y
C
D

10/9/2012 RA/Sept2012-Jan2013 19
 Example 2

Draw Y  (A  B)(C  D) using only NOR gates.

1 Double invert the expression .

Y  (A  B)(C  D)

2
Keep the top inversion bar. Apply DeMorgan’s Theorem 1 to the bottom inversion
bar to eliminate the AND operation.

Y  (A  B)  (C  D)

3 Draw the circuit using only NOR gates.

A
B
Y
C
D

10/9/2012 RA/Sept2012-Jan2013 20