COMPUTER ORGANIZATION

Digital Electronic Circuit Design –

Lecture 1

Consultant/ Lecturer NIBM

Mrs. Chami Muthugamage
B.Sc.(Hons) in MIS, MBA
 Lecture Objectives

1. Define and Identify Boolean Algebra Rules

2. Apply Boolean Algebra Rules to Simplify Boolean
Expressions
3. Use Perfect Induction Method to solve Boolean
Expression
4. Understand the basic logics of NOT, OR and AND
operation
5. Use De Morgan’s Theorem to simplify Boolean
Expressions
2
Digital Signal
◼ It is an electrical signal that has two
discrete values or levels. These levels may
be called as LOW level and HIGH level. The
signal will always be of one of the two levels

◼ HIGH→ LOGIC 1
◼ LOW→ LOGIC 0
Positive Logic
5V
High LOGIC1
3.5V

1.5V
Low
LOGIC 0
0V
Negative Logic
5V
Low LOGIC0
3.5V

1.5V
High
LOGIC 1
0V
Digital (Logic) Circuit
◼ A circuit that processes digital signals
◼ I.e. Digital circuits operate in the Binary
mode where each input and output voltage
represents either 0 or 1
◼ This characteristic of logic circuits allows the
use of Boolean Algebra as a way of
analyzing and designing digital circuits
Boolean Algebra
◼ Algebra associated with binary numbers
is called Boolean algebra
◼ Variables used in Boolean Algebra are
called Boolean variables
Boolean Variables
◼ It is a variable that can only have one
of two values : 0 or 1

◼ Example:
◼ If X is Boolean variable then
◼ X = 0 or X = 1
Boolean Algebra
◼ Two entities 0 and 1 together with the
3 operations AND, OR, NOT is called
Boolean Algebra

◼ B. A = {0, 1 │ AND, OR, NOT}

◼ The three operations are defined as

follows
NOT Operation
(Complementation)

X ഥ
NOT (X)/X
0 1
1 0
AND Operation (Logical
Multiplication)

X Y X AND Y/ (X.Y)

0 0 0
0 1 0
1 0 0
1 1 1
OR Operation
(Logical Addition)

X Y X OR Y/
(X+Y)
0 0 0
0 1 1
1 0 1
1 1 1
 Boolean Algebra Rules

1) X+0=X 6) X.X = X
2) X+1=1 7) ഥ 1
X + X=
3) X.0 = 0 8) X. 𝑋ത = 0
4) X.1 = X
9) 𝑋= X
5) X+X=X
Boolean Algebra Rules

10) Cumulative law

A+B=B+A
A. B = B. A
Boolean Algebra Rules
11) Associative Law
a) (A + B) + C = A + (B + C)

b) (A. B). C = A. (B. C)

12) Distributive Law

a) A. (B + C) = A. B + A. C

b) A + B. C = (A + B)(A + C)
Boolean Algebra Rules
13) Redundancy Law
a) A + A. B = A
b) A (A + B) = A

14)
a) X + 𝑋Y = X + Y
b) 𝑃 𝑄+ P = P + 𝑄
c) 𝐴+A𝐵=𝐴+𝐵
Perfect Induction
◼ Perfect Induction employs a truth table,
which describes the validity of the
Boolean entity for all the possible value
combinations of the Boolean variables
Examples
◼ Prove the following using Perfect Induction

1)X + XY = X
2)X (X + Y) = X
3)X + 𝑋 Y = X + Y

Note
No of combinations = 2n
If n = no of variables
 Example 1: X +XY = X

X Y XY X+XY
0 0 0 0
0 1 0 0
1 0 0 1
R.H.S 1 1 1 1
L.H.S

L.H.S = R.H.S
Example 1
◼ Using other methods
X + XY = X
LHS→ = X + XY
=X(1 + Y)
=X . 1
=X
=RHS
Using Boolean algebra, simplify the
following expressions:

(i) A = X Y Z + X YZ + X Y Z + XYZ
(ii ) X = AB + A( B + C ) + B( B + C )
(iii ) A = X + Y + X Y + ( X + Y ). X Y
(i) A = XY Z + XYZ + X YZ + XYZ
= XY (Z + Z) + XZ( Y + Y )
= XY + XZ
(ii) X = AB + A(B + C) + B(B + C)
= AB + AB + AC + B.B + BC
= AB + AC + B + BC
= B( A + 1 + C) + AC
= B + AC
A = X + Y + XY + ( X + Y).XY
= X + Y + XY
=X+Y+Y
=1
(iv ) Z = ABC[AB + C(BC + AC)]
( v) Y = (A + A)(AB + AB C)
( v i) Y = (A + B)(A + C)
( vii) Z = AB + ABC + ABCD+ ABCDE
De Morgan's Theorem
1. 𝑋 + 𝑌= 𝑋 . 𝑌
2. 𝑋𝑌 = 𝑋 + 𝑌
Questions
1. ത
𝐴 + 𝐵𝐶
2. (A + B) . (𝐶ҧ + D)
3. ത Y+ 𝑋𝑌
𝑋.
4. (A + BC). (D + EF)
5. ഥ (W+
XY ഥ 𝑌)
ത

6. 𝐴. 𝐴𝐵 + 𝐵. 𝐴𝐵