Exp3 Simplifying Boolean Expression
Exp3 Simplifying Boolean Expression
Learning Outcome:
At the end of the period the learner will be able to design a simplified
logic circuit using any of the simplifying method (the Boolean algebra
rules, Quine Mc Cluskey or Karnaugh Map)
Problem:
Design a 3- bit logic circuit that will determine if the no. of 1’s
is more than of 0’s. 0 = 0>1 and 1 = 1>0.
Solution:
A B C X SOP POS
0 0 0 0
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
Boolean Expression in Sum Of Product (SOP)
___________________________________________________________
Logic Circuit:
__________________________________________________________
Logic Circuit:
OR GATE(7432)
OR GATE(7432)
DISCUSSION: