Title

BOOLEAN ALGEBRA

Objective
Understanding basics of Boolean Algebra and application in IC logic gates and combined circuits.

Materials
 Hex Inverter (IC 7404)
 Quad 2 Inputs AND gate (IC 7408)
 Quad 2 Inputs OR gate (IC 7432)
 Quad 2 Inputs NAND gate (IC 7400)
 Quad 2 Inputs NOR gate (IC 7402)
 Digital logic trainer

Methodology

Part A : Boolean Algebra

Figure 3.1

Expression for gate A, B, C, D, E and F in figure 3.1 are included in result for part A.
Part B : De Morgan’s Theorem

Figure 3.2

Figure 3.3

Circuit was connected as in figure 3.2. Power supply was turned on to confirm the outcome which
then filled in table 3.1 as in result for part B. The procedure was repeated for circuit in figure 3.3 for
table 3.2 result.

Part C

Figure 3.4
 Figure 3.5

Circuit was connected as in figure 3.4 and then figure 3.5. The power supply was turned on and the
result was confirmed and filled in table 3.3 and 3.4. Power supply was turned off.
Result
Part A

Gate A : 𝐴 + 𝐵
Gate B : 𝐵 + 𝐶
Gate C : 𝐶̅ + 𝐷
Gate D : (𝐴 + 𝐵) • (𝐵 + 𝐶)
Gate E : ( ̅𝐶 + 𝐷) • 𝐴̅
Gate F : [(𝐴 + 𝐵) • (𝐵 + 𝐶)] + [(𝐶̅ + 𝐷) • 𝐴̅]

Part B

Figure 3.2A Figure 3.2B

Inputs Outputs Inputs Outputs
A B Y = ̅̅̅̅̅̅̅
𝐴•𝐵 A B Y = 𝐴̅ + 𝐵̅
0 0 1 0 0 1
0 1 1 0 1 1
1 0 1 1 0 1
1 1 0 1 1 0
Table 3.1

A = 1, B = 1 A = 0, B = 1

A = 1, B = 0 A = 0, B = 1
Figure 3.6 From Top Right, clockwise: 00, 01, 10, 11 input results for figure 3.3A
 Figure 3.3A Figure 3.3B
Inputs Outputs Inputs Outputs
A B Y = ̅̅̅̅̅̅̅̅
𝐴+𝐵 A B Y = 𝐴̅ • 𝐵̅
0 0 1 0 0 1
0 1 0 0 1 0
1 0 0 1 0 0
1 1 0 1 1 0
Table 3.2

A = 1, B = 1 A = 0, B = 0

A = 1, B = 0 A = 0, B = 1
Figure 3.7 From Top Right, clockwise: 00, 01, 10, 11 input results for figure 3.3B
Part C

Figure 6.5
inputs outputs
A B C D
0 0 0 0 1
0 0 0 1 1
0 0 1 0 1
0 0 1 1 1
0 1 0 0 1
0 1 0 1 0
0 1 1 0 1
0 1 1 1 0
1 0 0 0 1
1 0 0 1 1
1 0 1 0 1
1 0 1 1 0
1 1 0 0 1
1 1 0 1 0
1 1 1 0 0
1 1 1 1 0
Table 3.3

0000 0001

0010 0011
Figure 3.8(1) Result for gate combination according to figure 6.5 with ‘ABCD’ input label.
 0100 0101

0110 0111

1000 1001

1010 1011
Figure 3.8(2) Result for gate combination according to figure 6.5 with ‘ABCD’ input label.
 1100 1101

̅
1110 1111
Figure 3.8(3) Result for gate combination according to figure 6.5 with ‘ABCD’ input label.

Figure 6.6
inputs outputs
A B C D
0 0 0 0 1
0 0 0 1 1
0 0 1 0 1
0 0 1 1 1
0 1 0 0 1
0 1 0 1 0
0 1 1 0 1
0 1 1 1 0
1 0 0 0 1
1 0 0 1 1
1 0 1 0 1
1 0 1 1 0
1 1 0 0 1
1 1 0 1 0
1 1 1 0 0
1 1 1 1 0
Table 3.4
 0001 0010

0011 0100

0101 0110

0111 1001
Figure 3.9(1) Result for gate combination according to figure 6.6 with ‘ABCD’ input label.
 1010 1011

1100 1101

1110 1111
Figure 3.9(2) Result for gate combination according to figure 6.5 with ‘ABCD’ input label.

Discussions

Boolean Algebra involves mathematical operation using substitutes symbol in generalizing the input
and output of the Logic Gates. The dual presence of the states in electronics, Low/High or ‘1’/‘0’ makes
the Boolean applicable in determining the result. For Part A, some of Boolean Algebra’s operation was
shown by translating AND gate into multiply, also OR gate operation into summation.
 In part B, De Morgan’s Theorem was used to convert between summation and multiplication
operation in addition of reversing the input/output states with using bar sign,” ̅ “. In conjunction with
Boolean Algebra, De Morgan’s Theorem is used with several orders and rules. Reversion of sign
(between × and +), putting individual short bar over input sign and putting long bar for overall
expression are the rules. In the IC interfacing, the logic gates are exchanged with either NAND, NOR
and Inverter logic gates such as shown in the Part B procedures.

In part C, the application of Boolean Algebra and De Morgan’s Theorem was tested in IC interfacing
with multiple inputs. The suitable expression for the IC logic gates combination could be represented
as follow :-
𝑌 = 𝐴̅(𝐶̅ + ̅
𝐷 + 𝐵̅𝐶𝐷) + 𝐴𝐶̅ (𝐵̅ + 𝐷 ̅)
Question

1. Do the results in Table 3.1 and Table 3.2 prove the two De Morgan’s Theorem?
Yes.

2. What can you conclude from the results in Table 3?

The identical outputs for every combination of identical inputs confers that the IC in
combinations are using same principle over different type of logic gates and wiring. The principle
could be explained by using Boolean Algebra to which it led to the exact same solution.
𝐴̅𝐶̅ + (𝐴𝐶̅ + 𝐴̅𝐶 )(𝐷
̅ + 𝐵̅)

3. Simplify the equation.

a) Z = ( ̅𝐴 + 𝐵)(𝐵̅ + 𝐴)
= (𝐴̅𝐴 + ̅𝐴𝐵̅ + 𝐵𝐴 + 𝐵𝐵̅)
= 0 + 𝐴̅𝐵̅ + 𝐴𝐵 + 0
= 𝐴̅𝐵̅ + 𝐴𝐵

b) Z = ( ̅𝐴 + 𝐶)(𝐷
̅ + 𝐵)
= (𝐴̅B + ̅𝐴𝐷̅ + 𝐵𝐶 + 𝐶𝐷
̅)

4. Simplify the expressions and draw the logic circuit for the simplified expressions.
a) 𝑍 = 𝐴𝐵𝐶 + 𝐴𝐵̅(𝐴̅ • 𝐶̅ )
= 𝐴𝐵𝐶 + 𝐴𝐴̅𝐵̅ • 𝐴𝐵̅𝐶̅
= 𝐴𝐵𝐶 + 0𝐵̅ • 𝐴𝐵̅𝐶̅
= 𝐴𝐵𝐶 + 0
= 𝐴𝐵𝐶

b) 𝑍 = 𝐴̅𝐶 (𝐴̅𝐵𝐷) + 𝐴̅𝐵𝐶̅ • 𝐷 ̅ +A𝐵̅C

̅ ̅ ̅
= 𝐴𝐶𝐵𝐷 + 𝐴𝐵𝐶 • 𝐷 +A𝐵̅C̅
= 𝐴̅𝐵(𝐶𝐷 + 𝐶̅ • 𝐷 ̅ )+A𝐵̅C
= 𝐴̅𝐵(𝐶𝐷 + 𝐶̅ 𝐷̅ ) + 𝐴𝐵̅𝐶
References

De Morgan’s Theorems, Chapter 7-Boolean Algebra, Vol. IV – Digital, available online at:
https://www.allaboutcircuits.com/textbook/digital/chpt-7/demorgans-theorems/ access date : 13th
Dec 2018.

K Map (Karnaugh Map), Batam A., GeeksforGeeks, available online at :

https://www.geeksforgeeks.org/k-mapkarnaugh-map/ surfed at: 3rd Dec 2018.

Introduction to Boolean Algebra, Chapter 7-Boolean Algebra, Vol. IV – Digital, available online at:
https://www.allaboutcircuits.com/textbook/digital/chpt-7/introduction-boolean-algebra/ access
date : 13th Dec 2018.