EEE311

Digital Electronics
Lecture 6 – 05/09/2022

Dr. MD. AMIRUL ISLAM

Associate Professor
EEE, BSMRSTU, Gopalganj
Boolean Algebra

2
 Practice Examples

 Ronald J. Tocci,Neal S.Widmer - Digital Systems Principles and Applications (2007) 3

 Practice Examples

 Ronald J. Tocci,Neal S.Widmer - Digital Systems Principles and Applications (2007) 4

 Practice Examples
Simplify the following expression:

 Ronald J. Tocci,Neal S.Widmer - Digital Systems Principles and Applications (2007) 5

 Practice Examples
Simplify the following expression:

 Ronald J. Tocci,Neal S.Widmer - Digital Systems Principles and Applications (2007) 6

 DeMorgan’s Theorem for more than Two Variables

DeMorgan’s theorem can be easily extended for any number of

variables

 Ronald J. Tocci,Neal S.Widmer - Digital Systems Principles and Applications (2007) 7

 Practice Examples
Simplify the following expression:

 Ronald J. Tocci,Neal S.Widmer - Digital Systems Principles and Applications (2007) 8

 Implications and Circuits of DeMorgan’s Theorem

Alternate logic circuit for NOR gate

 Ronald J. Tocci,Neal S.Widmer - Digital Systems Principles and Applications (2007) 9

 Implications and Circuits of DeMorgan’s Theorem

Alternate logic circuit for NAND gate

 Ronald J. Tocci,Neal S.Widmer - Digital Systems Principles and Applications (2007) 10

 Practice Examples

 Ronald J. Tocci,Neal S.Widmer - Digital Systems Principles and Applications (2007) 11

 Practice Examples

1. 3.

2.

4.
 Ronald J. Tocci,Neal S.Widmer - Digital Systems Principles and Applications (2007) 12
 Universality of NAND Gate
NAND can be used to represent any basic gates or any
Boolean expression

 Ronald J. Tocci,Neal S.Widmer - Digital Systems Principles and Applications (2007) 13

 Universality of NOR Gate
NOR can be used to represent any basic gates or any
Boolean expression

 Ronald J. Tocci,Neal S.Widmer - Digital Systems Principles and Applications (2007) 14

 Exercise

= (AB)BC
= ABC

Hence, the output is HIGH only when all the inputs are HIGH.
 Ronald J. Tocci,Neal S.Widmer - Digital Systems Principles and Applications (2007) 15
 Exercise
3.12 (b) Simplify the output Boolean expression of the following logic circuit.
Draw the truth table for all the inputs.

=)

 Ronald J. Tocci,Neal S.Widmer - Digital Systems Principles and Applications (2007) 16

 Exercise
Determining truth table of x=)
A B C D D x=)
0 0 0 0 1 0 1 1 1 1
0 0 0 1 1 1 1 1 1 1
0 0 1 0 1 0 0 0 1 0
0 0 1 1 1 1 0 1 1 1
0 1 0 0 1 0 1 1 0 0
0 1 0 1 1 1 1 1 0 0
0 1 1 0 1 0 0 0 0 0
0 1 1 1 1 1 0 1 0 0
1 0 0 0 0 0 1 1 1 1
1 0 0 1 0 0 1 1 1 1
1 0 1 0 0 0 0 0 1 0
1 0 1 1 0 0 0 0 1 0
1 1 0 0 0 0 1 1 0 0
1 1 0 1 0 0 1 1 0 0
1 1 1 0 0 0 0 0 0 0
1 1 1 1 0 0 0 0 0 0 17
 Exercise

Hint: প্রত্যেক লেভেলের আউটপুট অর্থাৎ (A+B), (A+B)C, (A+B)C,

…… দিয়ে একটা টেবিল বানাতে হবে 18
 Exercise

Hint: OR গেট গুলোকে AND এবং AND গেট গুলোকে OR গেট দিয়ে প্রতিস্থাপন
করতে হবে। পরবর্তীতে Truth table বের করতে হবে। 19
 Exercise

Hint: প্রথম লেভেলের আউটপুট করা

আছে, বাকি গুলো করতে হবে।
 Ronald J. Tocci,Neal S.Widmer - Digital Systems Principles and Applications (2007) 20
 Exercise

Hint: অধিকাংশ সময়ে Simplify করলে লজিক গেট কম প্রয়োজন হয়। তাই
Simplify করে উপরের এক্সপ্রেশন গুলোর সার্কি ট আঁকতে হবে।
 Ronald J. Tocci,Neal S.Widmer - Digital Systems Principles and Applications (2007) 21
 Exercise
3-19. Write the expression for the output of the following circuit, and use
it to determine the complete truth table.

Hint: Same as previous problem (Slide 20).

 Ronald J. Tocci,Neal S.Widmer - Digital Systems Principles and Applications (2007) 22

 Exercise

 Ronald J. Tocci,Neal S.Widmer - Digital Systems Principles and Applications (2007) 23

Thank You
 Single Variable Theorems

 Ronald J. Tocci,Neal S.Widmer - Digital Systems Principles and Applications (2007) 25

 Multi Variable Theorems

 Ronald J. Tocci,Neal S.Widmer - Digital Systems Principles and Applications (2007) 26