Unit-5 Digital Circuits-

Dr. Leena G., Professor, Electrical & Electronics Engineering,

School of Engineering and Technology, Manav Rachna
International Institute of Research and Studies, Faridabad.
BEEE-Unit 5-Dr. Leena G. 1
 Unit 5-Digital Circuits
• Number systems,
• Conversion of bases (Binary, Decimal, Hexa,
Octal),
• Basic logic gates, AND OR, NAND , NOR –truth
tables
• Boolean algebra,
• De Morgan’s theorem
• Introduction to flip-flops SR,JK, D type,
• Introduction to Counters and Shift registers

BEEE-Unit 5-Dr. Leena G. 2

 Boolean Algebra
• Boolean algebra is a branch of mathematics
that deals with operations on logical values
with binary variables.
• The Boolean variables are represented as
binary numbers to represent truths: 1 = true
and 0 = false.
• Elementary algebra deals with numerical
operations whereas Boolean algebra deals
with logical operations

BEEE-Unit 5-Dr. Leena G. 3

 Boolean Algebra
 Commutative Laws
• Law 1: A+B = B+A
 This Law states that, A OR B is the same as B OR A
i.e. the order in which the variables are OR ed
is immaterial. This means that it makes no difference which
input of an OR gate is connected to A and which to B.
• Law 2: A.B = B.A
 This Law states that, A AND B is the same as B AND A i.e.
the order in which the variables are AND ed is immaterial.
 This means that it makes no difference which input of an
AND gate is connected to A and which to B.

BEEE-Unit 5-Dr. Leena G. 4

 Boolean Algebra-Commutative law -Proof
A+B B+A
A B
B A

Inputs Output Inputs Output

A B Y=A+B B A Y=B+A

0 0 0 0 0 0

0 1 1 0 1 1

1 0 1 1 0 1

1 1 1 1 1 1

BEEE-Unit 5-Dr. Leena G. 5

 Boolean Algebra-Commutative law -Proof
A.B B.A
A B

B A

Inputs Output Inputs Output

A B Y=A.B B A Y=B.A

0 0 0 0 0 0

0 1 0 0 1 0

1 0 0 1 0 0

1 1 1 1 1 1

BEEE-Unit 5-Dr. Leena G. 6

 Boolean Algebra
 Associative Laws
• Law 1: (A+B)+C = A+(B+C)
A OR B ORed with C is the same as A ORed with B OR C.
 This law states that the way the variables
are grouped and ORed is immaterial.

• Law 2: (A.B).C = A.(B.C)

 A AND B ANDed with C is the same as A ANDed with B
AND C.
 This law states that the way the variables
are grouped and ANDed is immaterial.
BEEE-Unit 5-Dr. Leena G. 7
 Boolean Algebra-Associative law -Proof
(A+B)+C A+(B+C)

A B
B C
C A
A B C A+B (A+B)+C A B C B+C A+(B+C)
0 0 0 0 0 0 0 0 0 0
0 0 1 0 1 0 0 1 1 1
0 1 0 1 1 0 1 0 1 1
0 1 1 1 1 0 1 1 1 1
1 0 0 1 1 1 0 0 0 1
1 0 1 1 1 1 0 1 1 1
1 1 0 1 1 1 1 0 1 1
1 1 1 1 1
BEEE-Unit
1
5-Dr. Leena G.
1 1 1 1138
5
 Boolean Algebra
Proof:
(A.B).C A.(B.C)

A B
B C C A

A B C A.B (A.B).C A B C B.C A.(B.C)

0 0 0 0 0 0 0 0 0 0
0 0 1 0 0 0 0 1 0 0
0 1 0 0 0 0 1 0 0 0
0 1 1 0 0 0 1 1 1 0
1 0 0 0 0 1 0 0 0 0
1 0 1 0 0 1 0 1 0 0
1 1 0 1 0 1 1 0 0 0
1 9/10/201 BEEE-Unit 5-Dr. Leena G. 1139
8 1 1 1 1 1 1 1 1 8
 Boolean Algebra
 Distributive Laws
• Law 1: A(B+C) = AB+AC
 This law states that ORing of several variables and
ANDing the result with a single variable is equivalent
to ANDing that single variable with each of the
several variables and then ORing the products.
• Law 2: A+BC = (A+B).(A+C)
 This law states that ANDing of several variables and
ORing the result with a single variable is equivalent
to ORing that single variable with each of the several
variables and then ANDing the products.

BEEE-Unit 5-Dr. Leena G. 10

 Boolean Algebra-Distributive law -Proof
AB+AC
A.(B+C) A
C B
B A A
C
A B C B+C A(B+C) A B C AB AC AB+AC
0 0 0 0 0 0 0 0 0 0 0
0 0 1 1 0 0 0 1 0 0 0
0 1 0 1 0 0 1 0 0 0 0
0 1 1 1 0 0 1 1 0 0 0
1 0 0 0 0 1 0 0 0 0 0
1 0 1 1 1 1 0 1 0 1 1
1 1 0 1 1 1 1 0 1 0 1
1 1
9/10/201 1 1 1 1 1 1 1 1 141
8 1
 Boolean Algebra-Distributive law -Proof
A (A+B).(A+C)
A+(B.C)
C B

B A A
C
(A+B)
A B C BC A+BC A B C A+B A+C
(A+C)
0 0 0 0 0 0 0 0 0 0 0
0 0 1 0 0 0 0 1 0 1 0
0 1 0 0 0 0 1 0 1 0 0
0 1 1 1 1 0 1 1 1 1 1
1 0 0 0 1 1 0 0 1 1 1
1 0 1 0 1 1 0 1 1 1 1
1 1 0 0 1 1 1 0 1 1 1
1 9/10/201 14
8 1 1 1 1 1 1 1 1 1 41
 DeMorgan’s Theorems
First theorem 𝐴 + 𝐵 = 𝐴 ∙ 𝐵
This theorem states that the complement of a sum of
variables is equal to the product of their individual
complements.
What it means is that the complement of two or
more variables ORed together, is the same as the
AND of the complements of each of the individual
variables.
This law can be extended to any number of variables.

13
 First theorem 𝐴+𝐵 =𝐴∙𝐵

A B 𝐴 𝐵 𝐴 𝐵
A B A+B 𝐴+𝐵

0 0 0 1 0 0 1 1 1

0 1 1 0 0 1 1 0 0

1 0 0 1 0
1 0 1 0

1 1 0 0 0
1 1 1 0

14
 DeMorgan’s Theorems
Second theorem 𝐴∙𝐵 =𝐴+𝐵
 This theorem states that the complement of a
product of variables is equal to the sum of their
individual complements.
 What it means is that the complement of two or
more variables ANDed together, is the same as the
OR of the complements of each of the individual
variables

15
 Second theorem 𝐴 ∙ 𝐵 = 𝐴 + 𝐵

A B 𝐴 𝐵 𝐴 +𝐵
A B AB 𝐴∙𝐵

0 0 0 1 0 0 1 1 1

0 1 0 1 0 1 1 0 1

1 0 0 1 1
1 0 0 1

1 1 0 0 0
1 1 1 0

16
BEEE-Unit 5-Dr. Leena G. 17
Boolean Algebra Theorems

BEEE-Unit 5-Dr. Leena G. 18

 Simplification using Boolean theorem
1. Prove that A.(A+B)=A
A.(A+B) = A.A +A.B
=A+A.B
=A.(1+B)= A
2. Prove that (A+B)(A+C)= A+B.C
A.A+A.C+B.A+B.C= A.A+A.C+A.B+B.C
=A+A.C+A.B+B.C
=A+A.B+B.C (since A+A.C=A)
=A+B.C (since A+A.B=A)
BEEE-Unit 5-Dr. Leena G. 19
Simplification using Boolean theorem
3. Prove that 𝐴𝐵 + 𝐴𝐵𝐶 + 𝐴𝐵 = 𝐴
𝐴𝐵 + 𝐴𝐵𝐶 + 𝐴𝐵 = 𝐴𝐵 1 + 𝐶 + 𝐴𝐵
= 𝐴𝐵 + 𝐴𝐵 (since 1 + C = 1)
= 𝐴(𝐵 + 𝐵)
= 𝐴 (since 𝐵 + 𝐵 = 1)
= hence proved

BEEE-Unit 5-Dr. Leena G. 20

Simplification using Boolean theorem
4. Prove that (𝐴 + 𝐵)(𝐴 + 𝐵) = 𝐴
𝐴 + 𝐵 𝐴 + 𝐵 = 𝐴𝐴 + 𝐴𝐵 + 𝐵𝐴 + 𝐵𝐵
= 𝐴𝐴 + 𝐴𝐵 + 𝐴𝐵 + 𝐵𝐵
= 𝐴 + 𝐴𝐵 + 𝐴𝐵 + 0 (since 𝐴A=A and 𝐵𝐵 = 0)
= 𝐴 + 𝐴(𝐵 + 𝐵)
= 𝐴 + 𝐴 (since 𝐵 + 𝐵 = 1)
= 𝐴 (since 𝐴 + 𝐴 = 𝐴)
= hence proved

BEEE-Unit 5-Dr. Leena G. 21

Simplification using Boolean theorem
5. Prove that A 𝐵 + 𝐶(𝐴𝐵 + 𝐴𝐶) = 𝐴(𝐵 + 𝐶)
= A 𝐵 + 𝐴𝐵𝐶 + 𝐴𝐶𝐶
= A 𝐵 + 𝐴𝐵𝐶 + 𝐴𝐶
= A 𝐵(1 + 𝐴𝐶) + 𝐴𝐶
= A 𝐵 + 𝐴𝐶 since (1+AC)=1
= 𝐴𝐵 + 𝐴𝐴𝐶
= 𝐴𝐵 + 𝐴𝐶
= 𝐴(𝐵 + 𝐶)
= hence proved
BEEE-Unit 5-Dr. Leena G. 22
Simplification using Boolean theorem
6. Prove that
A𝐵 + 𝐴 𝐵 + 𝐶 + 𝐵(𝐵 + 𝐶) = 𝐵 + 𝐴𝐶
= 𝐴𝐵 + 𝐴𝐵 + 𝐴𝐶 + 𝐵𝐵 + 𝐵𝐶
= 𝐴𝐵 + 𝐴𝐶 + 𝐵 + 𝐵𝐶
(since AB+AB=AB and BB=B)
= 𝐴𝐵 + 𝐴𝐶 + 𝐵(1 + 𝐶)
= 𝐴𝐵 + 𝐴𝐶 + 𝐵 since 1+C =1
= 𝐵(𝐴 + 1) + 𝐴𝐶
= 𝐵 + 𝐴𝐶 Hence proved
BEEE-Unit 5-Dr. Leena G. 23
Simplification using Boolean theorem
7. Prove that 𝐴𝐵(𝐶 + 𝐵𝐷) + 𝐴𝐵) 𝐶 = 𝐵 𝐶
= 𝐴𝐵𝐶 + 𝐴𝐵𝐵𝐷 + 𝐴𝐵) 𝐶
= 𝐴𝐵 𝐶 + 0 + 𝐴𝐵) 𝐶 (since 𝐵 𝐵 = 0)
= 𝐵(𝐴𝐶 + 𝐴) 𝐶
= 𝐵(𝐴 + 𝐶) 𝐶
(Since 𝐴 + 𝐴𝐵 = 𝐴 + 𝐵 and 𝐴 + 𝐴𝐵 = 𝐴 + 𝐵)
= 𝐴𝐵 + 𝐵𝐶) 𝐶 =𝐴𝐵𝐶 + 𝐵 𝐶𝐶
=𝐴𝐵 𝐶 + 𝐵𝐶 (since CC=C)
= 𝐵𝐶(𝐴 + 1)=𝐵𝐶 (since 𝐴 + 1 = 1)
Hence proved
BEEE-Unit 5-Dr. Leena G. 24
 Additional Exercise
• Prove the following
1. (𝐴 + 𝐵) (𝐵 + 𝐶) (𝐶 + 𝐴) = 𝐴𝐵 + 𝐵𝐶 + 𝐶𝐴
2. 𝐴𝐵 + 𝐵𝐶(𝐵 + 𝐶) = 𝐵(𝐴 + 𝐶)
3. 𝐴𝐵𝐶 + 𝐴 𝐵 + 𝐶 = 𝐴
4. 𝐴𝐵𝐶 + 𝐵𝐶 + 𝐴𝐶 = 𝐶

BEEE-Unit 5-Dr. Leena G. 25