Scribd
Upload
76 views19 pages

EEE301 Digital Electronics: Dr. A.S.M. Mohsin

This document summarizes a lecture on digital electronics that covered Boolean theorems, DeMorgan's theorems, and their applications. Key points included: 1) Boolean theorems help simplify logic expressions and circuits using rules like distribution, association, commutation, and identities. 2) DeMorgan's theorems state that the OR of inverted variables equals the inverted AND, and the AND of inverted variables equals the inverted OR. 3) Examples showed applying the theorems to factor, simplify, and derive equivalent logic expressions and circuits.

Uploaded by

Aaa Aaa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
76 views19 pages

EEE301 Digital Electronics: Dr. A.S.M. Mohsin

This document summarizes a lecture on digital electronics that covered Boolean theorems, DeMorgan's theorems, and their applications. Key points included: 1) Boolean theorems help simplify logic expressions and circuits using rules like distribution, association, commutation, and identities. 2) DeMorgan's theorems state that the OR of inverted variables equals the inverted AND, and the AND of inverted variables equals the inverted OR. 3) Examples showed applying the theorems to factor, simplify, and derive equivalent logic expressions and circuits.

Uploaded by

Aaa Aaa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 19

EEE301 Digital Electronics

Lecture 2

Dr. A.S.M. Mohsin


Assistant Professor, Department of EEE
BRAC,UB50511
E-mail:[email protected]

1
Lecture Outcome
• Boolean Theorem
• DEMORGAN’S THEOREMS
• Implications of DEMORGAN’S THEOREMS
• Universality of NAND Gates and NOR Gates
• Alternate Logic Gate Representation
• Logic Symbol Representation
• Interpreting Logic Circuit

2
Boolean Theorem
• Boolean theorem help to simplify logic expression and logic circuits.
• For single value theorem x is a logic variable that can be either 0 or a
1.
• Each theorem is accompanied by a logic circuit.

3
Single Variable Theorems

4
Example
• The variable x may actually represents an expression containing more
than one variable.
ത 𝐵),
• For example, if we have 𝐴𝐵(𝐴 ത we can invoke theorem 4 by letting
x=𝐴𝐵ത and thus x𝑥ҧ = 𝐴𝐵(𝐴
ത 𝐵)=0
ത
• The same idea can be applied to the use of any of these theorems

5
Multivariable Theorems
• Commutative law
9. x+y=y+x
10. x.y=y.x
These law indicate that the order in which OR or AND two variables is
unimportant; the result is the same.
• Associative law
11. x+(y+z)=(x+y)+z=x+y+z
12. x(yz)=(xy)z=xyz
We can group the variable in an AND or OR expression any way we want

6
Multivariable Theorems
• Distributive law

13a. x(y+z)=xy+xz
13b. (w+x)(y+z)=wy+xy+wz+xz

An expression can be expanded by multiplying term by term just the same as


ordinary algebra.
This theorem also indicate that we can factor an expression. That is, if we
have a sum of two (or more) terms, each of which contains a common
variable the common variable can be factored out just as in ordinary algebra.

7
Example: Distributive Law
ത + 𝐴ҧ𝐵ത 𝐶,ҧ we can factor out the 𝐵ത variable as:
• If the expression is, A𝐵𝐶
ത + 𝐴ҧ𝐵ത 𝐶ҧ = 𝐵(𝐴𝐶
A𝐵𝐶 ത + 𝐴ҧ𝐶)ҧ

• Consider the expression ABC+ABD, here two terms have variable A


and B as common, and so A and B can be factored out of both terms.
That is,
ABC+ABD=AB(C+D)

8
Multivariable Theorems
14. 𝑥 + 𝑥𝑦 = 𝑥
15a. x+𝑥𝑦ҧ =𝑥+𝑦
15b. 𝑥ҧ + 𝑥𝑦 = 𝑥ҧ + 𝑦

9
Multivariable Theorems
14. 𝑥 + 𝑥𝑦 = 𝑥

10
Multivariable Theorems

x y xy x+xy
0 0 0 0
0 1 0 0
1 0 0 1
1 1 1 1

• Note that the value of the entire expression, is always same as x.


• Alternatively, theorem 14 can be also proved by factoring x and using
theorem 6 , x+xy=x(1+y)=x.1=x
11
Multivariable Theorems
• All of these Boolean theorem can be useful in simplifying logic
expression that is reducing the number of terms in the expression.
When this is done, the reduced expression will produce a circuit that
is less complex than the one that the original expression would have
produced.

12
Example
ത + 𝐴𝐵ത 𝐷
y=𝐴𝐵𝐷 ഥ

Factor out the common variable A𝐵ത using theorem (13):


ത +𝐷
y= 𝐴𝐵(𝐷 ഥ)

Using theorem (8), the term in parentheses is equivalent to 1. Thus,


ത 1
y= 𝐴𝐵.
=𝐴𝐵ത [using theorem (2)]

13
Example
• Simplify z= (𝐴ҧ + 𝐵) 𝐴 + 𝐵
The expression can be expanded by multiplying out the term (theorem 13)
z=𝐴ҧ ∙ 𝐴 + 𝐴ҧ ∙ 𝐵 + 𝐵. 𝐴 + 𝐵. 𝐵
Invoking theorem (4), the term 𝐴ҧ ∙ 𝐴=0. Also 𝐵. 𝐵=B [theorem (3)]
z= 0+𝐴ҧ ∙ 𝐵 + 𝐵. 𝐴 + 𝐵=𝐴𝐵 ҧ + 𝐴𝐵 + 𝐵
Factoring out the variable B [theorem (13)], we have
z=𝐵 𝐴ҧ + 𝐴 + 1
Finally, using theorem (8) and (6),
z=𝐵
14
Example
ҧ
• Simplify x=𝐴𝐶𝐷 + 𝐴𝐵𝐶𝐷
Factoring out the common variables CD, we have,

• x=CD(A+ᾹB)
Utilizing theorem 15a, we can replace by (𝐴 +ᾹB) by A+B, so
x=CD(A+B)
=ACD+BCD

15
DEMORGAN’S THEOREMS
• Two most important theorems of Boolean algebra were contributed
by a great mathematician named DeMorgan.
• DeMorgan theorems are useful in simplifying expression in which a
product or sum of variables are inverted.

16.𝑥 + 𝑦 = 𝑥ҧ 𝑦ത
17. 𝑥 ∙ 𝑦 = 𝑥ҧ + 𝑦ത

16
DEMORGAN’S THEOREMS
• Theorem 16 says that when the OR sum of two variables are inverted,
this is same as inverting each variable individually and then ANDing
this inverted variables.
• Theorem 17 says that when the AND product of two variables are
inverted, this is same as inverting each variable individually then
ORing them.

17
DEMORGAN’S THEOREMS
• Although these theorems have been started in terms of single
variables x and y, they are equally valid for situation where x and y are
expressions that contain more than one variable.
• For example,
let’s apply them to the expression (𝐴𝐵ത + 𝐶) = (𝐴𝐵) ത ∙ 𝐶ҧ
Here, 𝐴𝐵ത = 𝑥 and C=y
• The result can be further simplified using theorem 17 as,
ത ∙ 𝐶=
(𝐴𝐵) ത ∙ 𝐶ҧ = (𝐴ҧ + 𝐵) ∙ 𝐶=
ҧ (𝐴ҧ + 𝐵) ҧ 𝐴ҧ𝐶ҧ + 𝐵 𝐶ҧ

18
Example
• 𝑧 = (𝐴ҧ + 𝐶) ∙ (𝐵 + 𝐷
ഥ)
= (𝐴ҧ + 𝐶 ) + (𝐵 + 𝐷
ഥ)
=𝐴ന ∙ 𝐶ҧ + 𝐵ത ∙ 𝐷
ന
=𝐴𝐶ҧ + 𝐵𝐷ത
• We can think this of as breaking the large inverter sign down the
middle and changing the AND sign (.) to an OR sign (+) or vice versa

19

You might also like