电⽓ 0521 孙嘉化 201568

Experiment III

Boolean Laws & Rules and DeMorgan’s Theorem

OBJECTIVES:
 Learn and verify Boolean laws and rules.
 Learn and prove DeMorgan’s theorem
 Use Modelsim tools to test combinational circuits.

MATERIALS:
 Quartus II sofrware 13.1 or higher.
 IBM or compatible computer with Pentium III or higher, 128 M-byte RAM or more, and 8 G-
byte Or larger hard drive.
 XC FPGA Board with Altera FPGA (Cyclone IV EP4CE6E22C8)

DISCUSSION:
A Boolean equation derived directly from a truth table or from a problem statement usually is not in
the simplest form. To have an efficient equivalent logic circuit, the Boolean equation representing the
logic design must be in the simplest from. Boolean equations can be simplified using Boolean algebra,
DeMorgan’s theorem, or/and Karnaugh maps. In this experiment, we will first present Boolean Laws
and rules as well as DeMorgan’s theorem, and then verify them.

XC FPGA Board

PROCEDURE:
Section I.
1. Open Quartus II and create a new project.
2. Create a “.vhd” file and write the VHDL code for the Boolean equation.

X1 <= A AND (B OR C OR D);

X2 <= (A AND B) OR (A AND C) OR (A AND D);

1
3. Test the program on your board by going through all the input combinations and observing the two
outputs. Fill the truth table

A B C D X1 X2 Symbol
0 0 0 0 o o

0
0
0
0
0
1
1
0
0

o
0

o
☆
c
i n

0 0 1 1 o o
;
0 1 0 0 0 0 A
-

Xz
0 1 0 1 o o
j ,

0 1 1 0 0 0 D

0 1 1 1 o o Boolean Equation
1 0 0 0 o o

1 0 0 1 1 XIEA.CB-lc.tl》
1
1 0 1 0 1 1
Xz : AB -1A ct A
1 0 1 1 1 1
1 1 0 0 1 1
1 1 0 1 1 1
1 1 1 0 1 1
1 1 1 1 1 1

Section II.
1. Create a new project call B_Rules
2. Using the same process before to build the circuit to verify the two absorption equation. You can use
two inputs A and B, four outputs X1, X2, Y1, Y2. If you show that the output waveforms X1and X2 are
the same, and the Y1 and Y2 are the same, you have already verify the Boolean absorption rule.

3. Fill the truth table

A B X1 X2 Y1 Y2
0 0 0 0 1 1

0 1 1 1 1 1
1 0
i
o

i
0

1 1 . ,

Section III.
You are asked to prove DeMorgan’s Theorem using either your target board or simulation tools.
1. Create a new project called Demorgan, build the circuit that enable you to prove the two equations. You
will need two inputs A and B, two pairs of outputs.

2
3. Fill the truth table
A B X1 X2 Y1 Y2
0 0 1 1 1 1

0 1 0 0 1 1

1 0 0 0 1 1
1 1 o o o o

Question
1. Draw the logic diagrams and list the truth tables for all the Boolean algebra rules except the
absorption rule.
CxtncxtYI-xz_XYCXtnlcxtYIZY.si/YZx
'
YoY x =,= Z

o o o o -
2
Y
%
0 0 0
-
0 1 0 0

9 6 9
。

2
.
。
1 0 1 1
'
1 1
1 1
1
Y 1 1

Xcxt Y) ×
= =
z
cxtnixy
XYXCXtzxooooY.ioY
X Y Cxtinxy x ⼀⼀

0
0

1
0

0
0
0
x
Z

0 1 0 0
X - 1 0 1 1
1 0 0 0
Y -
1 1 1
,
1 1 1 1

xYtY-Z-NYXYXYtYXtYxii0.in -

2
1 0 1 1

1 1 1 1

2. Apply Boolean laws and rules and DeMorgan’s theorem to simplify the following Boolean equations.
Draw the simplified logic diagrams.

'
Y
'
'
(A 1 13 ) B t aa
ABCHB c) B
' = -
t
X : ( A 1 13) (
-

分 B t Atd
'
A
'

= 13 +
的4134 ⼭ ⼗ CB 4C )
'
= (A 1 ⽇ )
-

' '
= A B tB t A
' '
-1 C

1 4 AB ⼗ Ad -113C
'
A A t A 13 1 3
'
+ 13 ⼼
'
⼆ 13 - '

B + A td
' '

= A t
'
1 )
'

t AB t 1北 ⼗ (13 + 11 0
'

= o t (A B 1 3 -
t o
= A 4 13 1 C -
'

' '
ABHAC
'
A t B t
'

= t C '
A
' ' '
A t B CHA ) t (肚 ⼉ X
i
= -

'
'
= A t B td

'
A
'
B -
X
d