Boolean Algebra Examples

Boolean Algebra examples of how to reduce the number of digital gates

using Boolean Algebra Laws

We have seen throughout this section that digital logic functions

can be defined and displayed as either a Boolean Algebra
expression or as a logic gate truth table. So here are a few
examples of how we can use Boolean Algebra to simplify larger
digital logic circuits.

Boolean Algebra Example No1

Get the Equations and Construct a Truth Table for the logical
functions at points C, D and Q in the following circuit and
identify a single logic gate that can be used to replace the
whole circuit.

First observations tell us that the circuit consists of a 2-

input NAND gate, a 2-input EX-OR gate and finally a 2-
input EX-NOR gate at the output. As there are only 2 inputs to
the circuit labelled A and B, there can only be 4 possible
combinations of the input ( 22 ) and these are: 0-0, 0-1, 1-0 and
finally 1-1. Plotting the logical functions from each gate in
tabular form will give us the following truth table for the whole
of the logic circuit below.
 Inputs Output at

A B C D Q

0 0 1 0 0

0 1 1 1 1

1 0 1 1 1

1 1 0 0 1

From the truth table above, column C represents the output

function generated by the NAND gate, while
column D represents the output function from the Ex-OR gate.
Both of these two output expressions then become the input
condition for the Ex-NOR gate at the output.
It can be seen from the truth table that an output at Q is
present when any of the two inputs A or B are at logic 1. The
only truth table that satisfies this condition is that of
an OR Gate. Therefore, the whole of the above circuit can be
replaced by just one single 2-input OR Gate.

Boolean Algebra Example No2

Find the Boolean algebra/Equations and Truth Table for the
following Logic Gates/Symbols.
The system consists of an AND Gate, a NOR Gate and finally
an OR Gate. The expression for the AND gate is A.B, and the
expression for the NOR gate is A+B. Both these expressions
are also separate inputs to the OR gate which is defined
as A+B. Thus the final output expression is given as:
The output of the system is given as Q = (A.B) + (A+B), but the
notation A+B is the same as the De Morgan´s notation A.B,
Then substituting A.B into the output expression gives us a
final output notation of Q = (A.B)+(A.B), which is the Boolean
notation for an Exclusive-NOR Gate as seen in the previous
section.

Inputs Intermediates Output

B A A.B A+B Q

0 0 0 1 1

0 1 0 0 0

1 0 0 0 0

1 1 1 0 1
Then, the whole circuit above can be replaced by just one
single Exclusive-NOR Gate and indeed an Exclusive-NOR Gate
is made up of these individual gate functions.

Boolean Algebra Examples No3,4 and 5

Find the Logic Symbol and Truth Table of this equations
1. (A+B) + (A.B) + ( A + B) = Q
2. (A+B). (A + B) = Q (Assignment)

3. Construct the Logic Gate and make equations of this Truth Table;
(Assignment)

Inputs Intermediates Output

A B A B A.B A + B Q=(A.B)+(A+B)

0 0 1 1 0 1 1

0 1 1 0 1 0 0

1 0 0 1 0 1 0

1 1 0 0 0 1 1

4. Construct the Logic Gate and make equations of this Truth Table;
(Assignment)

Inpu
Output
t

A B A AND
 B

0 0 0

0 1 0

1 0 0

1 1 1

Boolean Algebra Example (3 inputs)

1. Find the Boolean algebra expression for the following
system.

This system may look more complicated than the other two to
analyse but again, the logic circuit just consists of
simple AND, OR and NOT gates connected together.
As with the previous Boolean examples, we can simplify the
circuit by writing down the Boolean notation for each logic gate
function in turn in order to give us a final expression for the
output at Q.
 Outpu
inputs Intermediates
t

A B C A.B.C B C B +C A.( B+C) Q

0 0 0 0 1 1 1 0 0

0 0 1 0 1 0 1 0 0

0 1 0 0 0 1 1 0 0

0 1 1 0 0 0 0 0 0

1 0 0 0 1 1 1 1 1

1 0 1 0 1 0 1 1 1

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

Then we can see that the entire logic circuit above can be
replaced by just one single input labelled “A” thereby reducing a
circuit of six individual logic gates to just one single piece of
wire, (or Buffer). This type of circuit analysis using Boolean
Algebra can be very powerful and quickly identify any
unnecessary logic gates within a digital logic design thereby
reducing the number of gates required, the power consumption
of the circuit and of course the cost.
2. Draw a logic circuit and construct a Truth Table for this equations (A + B)C.

3. Draw a logic circuit and construct a Truth Table for this equations AB + AC.

4. Draw a logic circuit and construct a Truth Table for this equations A + BC+ D

5. Draw a logic circuit and construct a Truth Table for this (A + B)(C + D) C
Boolean Algebra Example (3 inputs)
For more complicated expressions, tables are built from the truth tables of their basic
parts. Here are several:

1. Draw a truth table and Logic Circuit for this equation A+ B.C
A B C BC A+BC
0 0 0 0 0
0 0 1 0 0
0 1 0 0 0
0 1 1 1 1
1 0 0 0 1
1 0 1 0 1
1 1 0 0 1
1 1 1 1 1

2. Draw a truth table and Logic Circuit for this equation A(B+D).
A B D B+D A(B+D)
0 0 0 0 0
0 0 1 1 0
0 1 0 1 0
0 1 1 1 0
1 0 0 0 0
1 0 1 1 1
1 1 0 1 1
1 1 1 1 1
 3. Draw a truth table and Logic Circuit for this equation (A+B)(A+C).
A B C A+B A+C (A+B)(A+C)
0 0 0 0 0 0
0 0 1 0 1 0
0 1 0 1 0 0
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 1

4. Draw a truth table and Logic Circuit for this equation PT(P+Z).
P T Z T PT P+Z PT (P+Z)
0 0 0 1 0 0 0
0 0 1 1 0 1 0
0 1 0 0 0 0 0
0 1 1 0 0 1 0
1 0 0 1 1 1 1
1 0 1 1 1 1 1
1 1 0 0 0 1 0
1 1 1 0 0 1 0

5. Draw a truth table and Logic Circuit for this W(X+Y)Z.

W X Y Z W X+Y W(X+Y) W(X+Y)Z
0 0 0 0 1 0 0 0
0 0 0 1 1 0 0 0
0 0 1 0 1 1 1 0
0 0 1 1 1 1 1 1
0 1 0 0 1 1 1 0
0 1 0 1 1 1 1 1
0 1 1 0 1 1 1 0
0 1 1 1 1 1 1 1
1 0 0 0 0 0 0 0
1 0 0 1 0 0 0 0
1 0 1 0 0 1 0 0
1 0 1 1 0 1 0 0
1 1 0 0 0 1 0 0
1 1 0 1 0 1 0 0
1 1 1 0 0 1 0 0
1 1 1 1 0 1 0 0