Umaru Musa Yaraduwa University.

Physics Dept.
Dr. Nuraddeen Magaji Phy4308
 Outline

Introduction - Unique Feature of Boolean Algebra

- Laws of Boolean Algebra - Equivalent Switching
Dr. Nuraddeen Magaji Phy4308

Circuits - De Morgan's Theorems - Duals -

Conventional Problems
Unique property of Boolean algebra is assuming
only one of the two possible values of 0 and 1.

1 / 28
 Introduction

Laws of Boolean Algebra

1. OR Laws
Dr. Nuraddeen Magaji Phy4308

Law 1. A + 0 =A Law 3. A + A = A
Law 2. A + 1 = 1 Law 4. A + A = 1
Consider the following two possibilities:
2. AND Laws
Law 5. A . 0 = 0 Law 7. A . A = A
Law 6. A . 1 = A Law 8. A . A = 0

Consider the following two possibilities :

(i ) When A = 0, A = 1 A . A = 0.1 = 0
(ii ) When A = 1, A = 0 A . A = 1.0 = 0
3. Laws of Complementation
Law 9 0 1 Law 10. 1 0
Law11. ifA 0, then A 1 Law 12. ifA 1, then A 0 Law 13. A = A 2 / 28
 4 Commutative Laws

The commutative law of addition for two variables

Dr. Nuraddeen Magaji Phy4308

is written as:
La14 A+B = B+A
A
B
A+B B
A
B+A

The commutative law of multiplication for two

variables is written as:
Law 15 AB = BA
A
B
AB B
A
B+A
 5 Associative Laws

The associative law of addition for 3 variables is

Dr. Nuraddeen Magaji Phy4308

written as: law 16 A+(B+C) = (A+B)+C

A A A+B
A+(B+C)
B B
(A+B)+C
C B+C C

The associative law of multiplication for 3 variables

is written as: Law 17 A(BC) = (AB)C

A A AB
A(BC)
B B
(AB)C
C BC C
 6 Distributive Laws

The distributive law is written for 3 variables as

Dr. Nuraddeen Magaji Phy4308

follows: Law 18 A(B+C) = AB + AC

B A AB
B+C

C B
X
X
A A
C AC

X=A(B+C) X=AB+AC
 Boolean Algebra Theorems

Duality
The dual of a Boolean algebraic expression is obtained
Dr. Nuraddeen Magaji Phy4308

by interchanging the AND and the OR operators and

replacing the 1s by 0s and the 0s by 1s.
A(B+C)=(AB)+(AC) Applied to a valid
equation produces
A+(BC)=(A+B)(A+C) a valid equation
Theorem 1: DeMorgan
( A B ) = A + B ( A + B ) = A B
(AB) =A +B (A+B) = AB
Theorem 2: Absorption
A ( A + B ) =A A+(AB)=A
6 / 28
 Boolean Algebra Theorems
Boolean Description Equivalent Boolean Algebra
Expression Switching Law or Rule
Circuit
A+1=1 A in parallel with Annulment
closed = "CLOSED"
A+0=A A in parallel with Identity
Dr. Nuraddeen Magaji Phy4308

open = "A"
A.1=A A in series with Identity
closed = "A"
A.0=0 A in series with Annulment
open = "OPEN"
A+A=A A in parallel with Idempotent
A = "A"
A.A=A A in series with Idempotent
A = "A"
NOT A = A NOT NOT A Double Negation
(double negative) = "A"
A+A=1 A in parallel with Complement
NOT A = "CLOSED"
A.A=0 A in series with Complement
NOT A = "OPEN"
A+B = B+A A in parallel with B = Commutative
B in parallel with A
A.B = B.A A in series with B = Commutative
B in series with A
A+B = A.B invert and replace OR with de Morgans
AND Theorem
A.B = A+B invert and replace AND with de Morgans
OR Theorem
 Logic Operators

AND A B AND
0 0 0
Dr. Nuraddeen Magaji Phy4308

A AB 0 1 0
B 1 0 0
1 1 1

NAND (Not AND) A B NAND

0 0 1
A 0 1 1
AB 1 0 1
B
1 1 0

8 / 28
 Logic Operators

OR x B OR
0 0 0
Dr. Nuraddeen Magaji Phy4308

A A +B 0 1 1
B 1 0 1
1 1 1

NOR (Not OR) A B NOR

0 0 1
A 0 1 0
A+B 1 0 0
B
1 1 0

9 / 28
 Logic Operators

XOR (Exclusive-OR) x y XOR

0 0 0
Dr. Nuraddeen Magaji Phy4308

x x 0 1 1
y y 1 0 1
xy+xy
1 1 0

XNOR (Exclusive-NOR) x y ANOR

(Equivalence) 0 0 1
0 1 0
1 0 0
x x y xy+xy
y 1 1 1
x y

10 / 28
 Logic Operators

NOT (Inverter) A NOT

Dr. Nuraddeen Magaji Phy4308

0 1
x x
1 0

Buffer A Buffer

0 0
x x
1 1

11 / 28
 Multiple Input Gates

Dr. Nuraddeen Magaji Phy4308

12 / 28
 DeMorgans Theorem on Gates

AND Gate
F=AB F = (A B)
Dr. Nuraddeen Magaji Phy4308

F=A+B

OR Gate
F=A+B F = (A + B) F=AB

Change the Shape and bubble all lines 13 / 28

 Boolean Functions

Boolean Expression A B C F
F = A + B C
Dr. Nuraddeen Magaji Phy4308

Example: 0 0 0 0
Truth Table 0 0 1 1
0 1 0 0
All possible combinations
of input variables 0 1 1 0
1 0 0 1
Logic Circuit
1 0 1 1
x F 1 1 0 1
y
z 1 1 1 1

14 / 28
 Complement of a Function

DeMorgans Theorm
F A B C
Dr. Nuraddeen Magaji Phy4308

F A B C
F A B C
Duality & Literal Complement

F A B C
F A B C
F A B C
15 / 28
 Canonical Forms

Truth Table to Boolean Function

Dr. Nuraddeen Magaji Phy4308

A B C F F ABC ABC ABC ABC

0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 1

16 / 28
 Canonical Forms

Sum of Minterms A B C F F
F ABC ABC ABC ABC 0 0 0 0 0 1
Dr. Nuraddeen Magaji Phy4308

1 0 0 1 1 0
F m1 m4 m5 m7
2 0 1 0 0 1
F (1,4,5,7)
3 0 1 1 0 1
Product of Maxterms 4 1 0 0 1 0
F ABC ABC ABC ABC 5 1 0 1 1 0
F ABC ABC ABC ABC 6 1 1 0 0 1
7 1 1 1 1 0
F ABC ABC ABC ABC
F ( A B C )( A B C )( A B C )( A B C )
F M0 M2 M3 M6
F (0,2,3,6) 17 / 28
 Standard Forms

Sum of Products (SOP)

A B (C C )
Dr. Nuraddeen Magaji Phy4308

A B (1)
F ABC ABC ABC ABC
AB
AC ( B B )
AC
BC ( A A)
BC
F BC ( A A) AB(C C ) AC ( B B)

F BC AB AC
18 / 28
 Standard Forms

Product of Sums (POS)

AB(C C )
Dr. Nuraddeen Magaji Phy4308

F ABC ABC ABC ABC

BC ( A A)

AC ( B B )
F AC ( B B) AB(C C ) BC ( A A)

F AC AB BC
F ( A C )( A B)( B C )
19 / 28
 Two-Level Implementations

Sum of Products (SOP) B

C
Dr. Nuraddeen Magaji Phy4308

F BC AB AC A
B F
A
C
Product of Sums (POS) A
C
A
F ( A C )( A B)( B C ) B F
B
C
20 / 28
 Homework

2-1 Reduce the following Boolean expressions to the indicated

Dr. Nuraddeen Magaji Phy4308

number of literals:
(a) AC + ABC + AC to three literals
(b) (xy + z) + z + xy + wz to three literals
(c) AB (D + CD) + B (A + ACD) to one literal
(d) (A + C) (A + C) (A + B + CD) to four literals

2-2 Find the complement of F = AB + CD; then show that

FF = 0 and F + F = 1

21 / 28
 Homework
2-3 Find the complement of the following expressions:
(a) AB + AB (b) (AB + C)D + E
Dr. Nuraddeen Magaji Phy4308

(c) (A + B + C) (A + C) (A + C)

2-4 List the truth table of the function:

F = AB + AB + BC
2-5 Logical operations can be performed on strings of bits by
considering each pair of corresponding bits separately
(this is called bitwise operation). Given two 8-bit strings
A = 10101101 and B = 10001110, evaluate the 8-bit result
after the following logical operations: (a) AND, (b) OR,
(c) XOR, (d) NOT A, (e) NOT B.

22 / 28
 Homework
2-6 Draw the logic diagrams for the following Boolean
expressions:
Dr. Nuraddeen Magaji Phy4308

(a) Y = AB + B (A + C) (b) Y = BC + AC
(c) Y = A + CD (d) Y = (A + B) (C + D)

2-7 Simplify the Boolean function T1 and T2 to a minimum

number of literals. A B C T T
1 2
0 0 0 1 0
0 0 1 1 0
0 1 0 1 0
0 1 1 0 1
1 0 0 0 1
1 0 1 0 1
1 1 0 0 1
1 1 1 0 1
23 / 28
 Homework
2-8 Given the Boolean function
F = ABC + ABC + DAB + DAB + DAB
Dr. Nuraddeen Magaji Phy4308

(a) Obtain the truth table of the function.

(b) Draw the logic diagram using the original Boolean
expression.
(c) Simplify the function to a minimum number of literals
using Boolean algebra.
(d) Obtain the truth table of the function from the
simplified expression and show that it is the same as
the one in part (a)
(e) Draw the logic diagram from the simplified expression
and compare the total number of gates with the
diagram of part (b).

24 / 28