Switch off your Mobile Phone

or
Change Profile to Silent Mode
Boolean Algebra and Digital logic

Logic and Problem solving (MA4001NP)

Lecture (week 4)

By:- Aananda Bhattarai

Agenda:
 Review of week 3
 Week 4 lecture coverage
– Boolean Algebra
– Boolean algebra laws and Application
– Simplifying expressions using laws
– Circuit Design

3
Mr. Bean at exam..

4
Review of Week 3
Question:
Construct the logic circuit for the following expressions.

1. Z = A’.B + B’. C’
2. Z = A’.B’.C + A.B.C +A’.B’.C’
3. Z = A’ . B . C’ + A . B’ . C + A’ . B . C’

5
Any Questions?

6
Laws of Boolean Algebra:
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) Distributive
Laws 7
Laws of Bolean 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)

7. A + A = A AA=A Idempotent Laws

8
Laws of 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

11. A + B = A  B AB=A+B De Morgan’s Laws

9
Any Questions?

10
Circuit Design:
Consider the circuit below:

This circuit uses three gates (two NOT gates and an AND gate)

11
Circuit Design (Contd.):
However, by de Morgan’s laws =

Now the circuit with the output is

• This circuit uses only two gates (one NOT gates and an OR gate).
• It is equivalent to the original circuit and is easier to build.

12
Workout Examples:

Example1:

Circuit after Simplification

13
Workout Examples (Contd.):
Example2:

14
Workout Examples (Contd.):
Example3: Show that A + A  B = A
= A+AB
= A  1 + A  B (Identity Law)
= A  (1 + B) (Distributive law)
= A1 (Domination Law)
= A

15
Circuit Design:
Note:
• We can simplify the expression algebraically (using any of
the laws 1 – 11) our simplified expression will represent a
circuit which is equivalent to the original one.
• The original circuit can actually be replaced by the new one
and will produce identical output for all possible
combinations of input values (i.e. pulses).
• The goal in the simplification is to reduce the number of
gates used by the circuit.
16
Circuit Design from Truth Table ..
Three Steps starting from given circuit requirements in
the form of a table.
1. Formulate a Boolean expression for the output
function from the given table.
2. Simplify this expression as much as possible using
Boolean algebra.
3. Draw the circuit corresponding to the simplified
output function.

17
Circuit Design (Contd.):
Example:
We will design a circuit corresponding to the following
truth table. The output function is labelled X.

18
Circuit Design (Contd.):
Step 1. First scan the output column for occurrences of 1. In this
example there are three (lines 1, 2 and 4).

For each of these lines construct a sub-expression involving A

and B and the operations AND () and NOT ( ͞ ) only that will
return the value 1 for the corresponding input values.

In row 1, A = 1 and B = 1 so A  B will return the value 1 for these

input values and for no others.
19
Circuit Design (Contd.):
In row 2, A = 1 and B = 0 so A  B will return the required 1
for these values
Finally, with A = 0 and B = 0, row 4 will require A  B
The three expression obtained are then combined
together using OR (+) operations. The final expression

X = (A  B) + (A  B) + (A  B)

20
Circuit Design (Contd.):
Step 2: Simplify the Boolean Expression.

X = (A  B) + (A  B) + (A  B)

21
Circuit Design (Contd.):
Step 3: The circuit for the simplified output function X
requires only two gates:

Check that the truth table for X = A + B agrees with the

original.

The method extends easily to three or more input pulses.

22
Circuit Design (Contd.):
ALTERNATIVE WAY BY TAKING ZERO

X ‘ = A’ .B
Taking complement on both side,
(X’)’ = (A’ .B)’

X = (A’)’ + B’ ( DOUBLE NEGATION & DE-MORGANS)

X = A + B’

23
Any Questions?

24
Circuit Design (Contd.):
Another Example:
Design a Circuit corresponding to:
A B C X
1 1 1 1
1 1 0 0
1 0 1 1
1 0 0 0
0 1 1 1
0 1 0 0
0 0 1 0
0 0 0 0
25
Circuit Design (Contd.):
Step 1 There is a 1 in lines 1, 3 and 5 of the output
column.

The sub-expressions which will return 1 in these lines are,

respectively A  B  C, A  B  C and A  B  C
The Boolean Expression is therefore given by

X = (A  B  C) + (A  B  C) + (A  B  C)

26
Circuit Design (Contd.):
Step 2 : Simplify X = (A  B  C) + (A  B  C) + (A  B  C)

X = (A  B  C) + (A  B  C) + (A  B  C)
X = A.C (B + B ) + (A  B  C)
X = A.C .1 + (A  B  C) (Complement law)
X = A.C + (A  B  C)
X = C . ( A + A . B)
X = C . {(A + A).(A + B)} (Distributive law)
X = C . (A + B)
The simplified Boolean Expression is therefore given by
X = C . (A + B)
27
Circuit Design (Contd.):
Step 3 The circuit for (A + B)  C is

28
Any Questions?

29
Exercises ……
Simplify and construct the logic circuit:
1. A’.B’ + (A.B)’
2. (A + B).(A + B) + A.(A + B’)
3. (A’. B + A.B’)’
4. ((A + C).(AB)’ + (BC + A’)’)’
5. (A.B’.C’ + A’.B’.C+A.B.C+A’.B.C’)

30
Exercises …
Simplify and Construct the logic circuit 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)
31
Summary: Week 4 Lecture
• Boolean Algebra
• Boolean algebra laws and Application
• Simplifying expressions using laws
• Circuit Design

32
What to Expect: Week 4 Tutorials
• Review and practice Boolean Algebra problems through
in-class assignments to actually acquire them.
• Practice problems to know how to simplify Boolean
expressions using laws.

33
Thank you