Digital Logic

Boolean Algebra and Digital logic

Lecture 3
Logic & Problem Solving
Agenda
 Review of week 2
 Week 3 lecture coverage
• Concept of Boolean Algebra
• Logic Gates
• Digital Logic Families

2
Faster than a calculator…..
Review of Week 2 (1)
Question:
Describe the followings with suitable examples :
a. Tautology
b. Contradiction
c. Logical equivalence
d. Inverse ,converse and contra positive of conditional

4
Review of Week 2 (2)
Question:
Determine the validity of the following arguments:

 p → q , q → r , r ├ p
 If I am not in Malaysia, then I am not happy; if I am
happy, then I am singing; I am into singing;
therefore, I am not in Malaysia.

5
Review of Week 2 (3)
Question:
Check for the validity for the following logical
consequence.
p  q, q  r ├ p
r

6
Any Questions?

7
Boolean Algebra:
• Operation of all modern digital computers is based on
binary system.

• A variable is a symbol used to represent a logical

quantity.

• Any single variable can have either 1 (high pulse) or a 0

(low pulse)value.

8
Boolean Algebra:
• The Complement is the inverse of a variable and is
indicated by a bar over variable (overbar).

For example, the complement of the variable A is A. If

A = 1, the A = 0. If A = 0, then A = 1.

• In Boolean Algebra, the truth tables A + B, A  B and A

for OR, AND and NOT gates are identical to those for
A  B, A  B, A.
9
Logic Gates:
• A logic gate is a simple digital circuit that corresponds
to one of the logical connectives.
• Transistors are combined together to form logic gates
• A large number of electronic circuits (in computers,
control units, and so on) are made up of logic gates.
• These process signals which represent true or false.

10
Logic Gates (Contd.):
• Real life examples:

11
Common Logic Gates:

12
Not Gate:

• Input (A)

• Truth Table
A NOT A (A)
1 0
0 1

Output
13
OR Gate:

• Truth Table
A B A +B
0 0 0
0 1 1
1 0 1
1 1 1

14
AND Gate:

• Truth Table
A B A .B
0 0 0
0 1 0
1 0 0
1 1 1

15
NAND Gate
A A NAND B
B

• Truth Table
A B A NAND B
0 0 1
0 1 1
1 0 1
1 1 0

16
NOR Gate
A A NOR B
B

• Truth Table
A B A NOR B
0 0 1
0 1 0
1 0 0
1 1 0

17
XOR Gate:
• XOR, or exclusive OR gate
– An XOR gate produces 0 if its two inputs are the
same, and a 1 otherwise
– Note the difference between the XOR gate
and the OR gate; they differ only in one
input situation
– When both input signals are 1, the OR gate produces
a 1 and the XOR produces a 0

31
XOR Gate:

Various representations of an XOR gate

32
Logic Circuits:
• Gates can be combined together in various ways to
make circuits with output from one gate serving as
input (or part of the input) to another. Such circuits are
called logic circuits.
• Example: Labeling the circuit diagram

• Note: The labeling is always carried out from left to

right (i.e. from input through to output).
20
Logic Circuits (Contd.):

A AB AB
B

• There are two input signals to the circuit.

• If these are labeled A and B they are initially inputs to the
AND gate.
• This transforms them to the output A · B which is then input
AB
to the NOT gate. The final output from the circuit is therefore

21
Logic Circuits (Contd.):
• Example

• In the circuit, There are THREE inputs and the

output is (A  B) + C

22
Logic Circuits (Contd.):
• Truth Table of Corresponding Circuit:

A B C B AB (A  B) + C
A
1 1 1 0 0 1
B
1 1 0 0 0 0
1 0 1 1 1 1
C
1 0 0 1 1 1
0 1 1 0 0 1
0 1 0 0 0 0
0 0 1 1 0 1
0 0 0 1 0 0

23
Another Boolean Algebra (Contd.)
The operations +,  and ͞ consequently satisfy the basic
laws 1, 2 and 3 of Boolean algebra. That is:

1. A+BB+A
ABBA
Commutative Laws

2. (A + B) + C  A + (B + C)
(A  B)  C  A  (B  C)
Associative Laws

3. A  (B + C)  (A  B) + (A  C)
A + (B  C)  (A + B)  (A + C) 24
Another Boolean Algebra (Contd.)
4. A + low = A A  high = A
Identity Laws
(or A + 0 = A and A  1 = A)

5. A + A = high A  A = low
Complement Laws
(or A + A = 1 and A  A = 0)

6. low = high high = low

Negation Laws
(0=1) (1=0)
25
 Another Boolean Algebra (Contd.)
8. A + high = high A  low = low
Domination Laws
(A + 1 = 1) (A  0 = 0)

9. A + (A . B) = A A  (A + B) = A
Absorption Laws

10. A = A
Double Negation

Law

26
11. A + B = A  B AB=A+B De
Another Boolean Algebra (Contd.)
Boolean Algebra laws are very important for simplifying
Boolean expressions and the main objectives of
simplification is to minimize the number of gates .
You all are requested to practice the Boolean algebra laws
thoroughly and be able to use it whenever it is
necessary .

27
Exercises …
Construct the logic circuit and truth for the following
expressions.
1) Z ( A B)  C
2) Z A  B  C
3) Z (A C)  (B C )
4) Z (A  B) (A  C )
5) Z A  (B C)
28
Any Questions?

29
Summary: Week 3 Lecture
• Concept of Boolean Algebra
• Logic Gates
• Digital Logic Families

30
What to Expect: Week 3 Tutorials

• Review and practice Digital Logic problems through

in-class assignments to actually acquire them.
• Practice problems to know how to design Digital logic
circuits.

31
Thank you