Scribd
Upload
14 views

Verification of Boolean Algebraic Rules and DeMorgan's Theorem

Verification of Boolean Algebraic Rules and DeMorgan’s Theorem

Uploaded by

Visoth Phal
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
14 views

Verification of Boolean Algebraic Rules and DeMorgan's Theorem

Verification of Boolean Algebraic Rules and DeMorgan’s Theorem

Uploaded by

Visoth Phal
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/ 9

Institute of Technology of Cambodia Electrical and Energy Engineering Department

DIGITAL ELECTRONIC LAB

Lab - 1
Verification of Boolean Algebraic Rules and DeMorgan’s
Theorem

LECTURED by: SENG Dararaksmey


Group: GEE-C1
Students Name: PHAL Visoth ID: e20200158

Academic year
2022-2023
❖ Problem 1

In Boolean Algebra, there are 12 basic rules that can be used to simplify logic function as
shown in the table below. From 1 to 9, the rules are straightforward. In this lab we want to
verify using simulation and waveform analysis for rule 10, 11, 12.

a) Verify the equation in 10, 11 and 12 using logic simplification method and
rule 1-9.
10. A + AB = A
 A(1 + B) = A

1+ B = 1 (Rule 2)
 A.1 = A (Rule 4) True

11. A + AB = A + B

By equation 10 we can write it as A + AB + AB = A + B

Applying (Rule 7) and (Rule 8) AA + AB + AA + AB = A + B

 ( A + A)( A + B) = A + B

Applying (Rule 6) 1.( A + B) = A + B True

12. ( A + B)( A + C) = A + BC  AA + AC + BA + BC = A + BC

By (Rule 7)  A(1 + C) + BA + BC = A + BC

By (Rule 2)  A + AB + BC = A + B or A(1 + B) + BC = A + BC

By (Rule 2) A + BC = A + BC True

1
b) Construct truth table for 10, 11 and 12.

10. A + AB = A
A B AB A+AB
0 0 0 0
0 1 0 0
1 0 0 1
1 1 1 1

11. A + AB = A + B
A B AB A + AB A+B
0 0 0 0 0
0 1 1 1 1
1 0 0 1 1
1 1 0 1 1

12. ( A + B)( A + C) = A + BC

A B C A+B A+C (A+B)(A+C) BC A+BC


0 0 0 0 0 0 0 0
0 0 1 0 1 0 0 0
0 1 0 1 0 0 0 0
0 1 1 1 1 1 1 1
1 0 0 1 1 1 0 1
1 0 1 1 1 1 0 1
1 1 0 1 1 1 0 1
1 1 1 1 1 1 1 1

2
c) Construct the schematic in Quartus and run the waveform analysis for each
rule discussed.

10. A + AB = A

➢ Schematic

➢ Waveform

3
11. A + AB = A + B

➢ Schematic

➢ Waveform

4
12. ( A + B)( A + C) = A + BC

➢ Schematic

➢ Waveform

5
❖ Problem 2
In digital electronics, there also exist a theorem that is not part of basic rules. It is called
DeMorgan’s Theorem. The formula for expressing this theorem for two variables are

Equation1 XY = X + Y

Equation2 X + Y = XY

a) Construct the Truth Table for both theories.

XY = X + Y
X Y XY X +Y
0 0 1 1
0 1 1 1
1 0 1 1
1 1 0 0

X + Y = XY
X Y X +Y XY
0 0 1 1
0 1 0 0
1 0 0 0
1 1 0 0

b) Construct the schematic in Quartus and run the waveform analysis for each
theorem discussed above.

Equation1 XY = X + Y
➢ Schematic

6
➢ Waveform

Equation2 X + Y = XY

➢ Schematic

7
➢ Waveform

❖ Conclusion

According to the Results of Simulation, The Output shows that the Truth Table is Correct.
DeMorgan’s Theorems are basically two sets of rules or law developed from the Boolean
expressions. These two Rules or Theorems allow the input variables to be negated and
converted from one form of a Boolean function into an opposite form.

You might also like