Scribd
Upload
5 views3 pages

Formulas

check it

Uploaded by

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

Formulas

check it

Uploaded by

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

Computer Engineering Drafting and

Design 1
Engr. Jerome Paul G. Viador

Experiment 3
CIRCUIT SIMPLIFICATION & SIMULATION
OBJECTIVES:
1. To construct circuit diagrams from the given Boolean expressions.
2. To simulate and compare the output of the unsimplified and simplified Boolean
expressions.
DISCUSSION:
The following are the laws/theorems of Boolean algebra:

Other Multivariable Theorem:

o (x + y) (x + z) = x + y z
o x + x’ y = x + y

Examples:

1) H = K L’ + K Let x = K, let y =
L’:
H=x+xy=x
= K +K L’ = K /Absorption Theorem/

2) Y = (A’ + B’) C D + (A’ + B’)


Let x = (A’ + B’), let y = C D:
Y = x + x y = x = A’ + B’ /Absorption Theorem/
3) W = (P Q R + P’ Q’) (S + T) +
(P’ + Q’) (S + T) + (S + T) Let
x = S + T, let y = (P’ + Q’):
Since x + x y = x, (P’ + Q’) (S + T) + (S + T) = (S + T) /Absorption Theorem/
W = (P Q R + P’ Q’) (S + T) + (S + T)
Let x = S + T, let y = (P Q R + P’ Q’)
W=x+xy=S+T

4) L = (M + N’) (M + P’) Let x =


M, let y = N’, let z = P’:
L = (x + y) (x + z) = x + y z = M + N’ P’ /Multivariable Theorem/

Computer Engineering Drafting and


Design 2 Engr. Jerome Paul G. Viador

5) Y = (A’ + B’ + A B) (A’ + B’ + C) Let


x = A’ + B’, let y = A B, let z = C:
Y = (x + y) (x + z) = x + y z
= A’ + B’ + A B C /Multivariable Theorem/
= A’ B’ + A B C /DeMorgan’s Theorem/

6) W = U’ + U V’
Let x = U’, let y = V’:
W = x + x’ y = x + y = U’ + V’ /Multivariable Theorem/

7) P = Q R’ S + (Q’ + R + S’) T
P = Q R’ S + (Q R’ S)’ T /DeMorgan’s Theorem/
Let x = Q R’ S, let y = T:
P = x + x’ y = x + y = Q R’ S + T /Multivariable Theorem/

8) J = K’ M’ (K’ + L + M) + K M
Let x = KM, let y = (K’ + L + M):
J = x + x’ y = x + y = K M + K’ + L + M /Multivariable Theorem/
= K’ + L + (M + K M) /Associative Theorem/
= K’ + L + M /Absorption Theorem/

SIMULATION:
I. Use the rules of Boolean algebra to simplify the following expressions:
a. M = P Q + P Q’
b. S = (T’ + U’) V + (T + U)
c. P = (Q’ R’ + S T) (Q’ R’ + Q)
d. U = (X + Y’ + W’ Z) (W Y + Y + W’ Z)
e. Y = (A’ + B + D’) A C + A B’ D
II. Using Circuit Wizard, construct the circuit diagram of the unsimplified and simplified
Boolean expressions above. (Attach the screenshots and .cwz file of your simulations.)

You might also like