Boolean Algebra

Lectures 13
1

Carry out simple operations with Boolean Algebra, Construct truth tables, Convert switch circuit /logic gates into Boolean Addition and Multiplication. Recognise properties of Boolean Algebra

A system may have more than two inputs and the Boolean expression for a threeinput OR-function having elements A, B and C is A+B+C. Similarly, a three-input AND-function is written as A B C. The equivalent electrical circuits and truth tables for three-input OR and AND-functions are shown in Figs. 1(a) and (b) respectively (next slide).
3

Fig 1(a) The OR-function electrical circuit and truth table

Input

Output
Input A 0 0 0 0 1 1 1 1 B 0 0 1 1 0 0 1 1 C 0 1 0 1 0 1 0 1 Output Z =A+B +C 0 1 1 1 1 1 1 1
4

Fig 1(b) The AND-function electrical circuit and truth table Input
Input A B C Output Z =Al Bl C

Output

0
0 0

0
0 1

0
1 0

0
0 0

0
1 1 1 1

1
0 0 1 1

1
0 1 0 1

0
0 0 0 1
5

Example 1 Derive the Boolean expression and construct a truth table for the switching circuit shown in Figure 2.
1 5 2 7

Solution :
The switches between 1 and 2 in Figure 2 are in series and have a Boolean expression of B . A. The parallel circuit 1 to 2 and 3 to 4 have a Boolean expression of (B . A + B ). The parallel circuit can be treated as a single switching unit, giving the equivalent of switches 5 to 6, 6 to 7 and 7 to 8 in series. Thus the output is given by :

Solution :
1
A 0 0 1 1

2
B 0 1 0 1

3
B.A 0 0 0 1

1 0 1 0

. +
1 0 1 1

= ( + )
1 1 0 0 1 0 0 0

The truth table is as shown above. Columns 1 and 2 give all the possible combinations of switches A and B. Column 3 is the and-function applied to columns 1 and 2, giving B.A. Column 4 is , that is, the opposite of column 2. Column 5 is the or-function applied to columns 3 and 4. Column 6 is , that is the opposite to column 1. The output is column 7 and is obtained by applying the and-function to columns 4, 5 and 86.

Example 2 Derive the Boolean expression.

l Input l

l Output

l l

Z A C A B A BC

B C C A C 0 1 0 1 0 1 0 1 1 0 1 0 1 0 1 0
0
0 0 0

A
1
1 1 1 0

AB
0 0 1

ABC
0
0 1 0 0 0 0 0

Z= AC+ABC
0 0 1

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

1
0 0 0 0

1
1 0 1

1
0 1 0

0
0

Z A C A B A BC

10

Example 3

Derive the Boolean expression and construct a truth table for the switching circuit shown in Figure 3.
5
6 9 8

11

Solution :
The parallel circuit 1 to 2 and 3 to 4 gives (A + B ) and this is equivalent to a single switching unit between 7 and 2. The parallel circuit 5 to 6 and 7 to 2 gives C + (A + B ) and this is equivalent to a single switching unit between 8 and 2. The series circuit 9 to 8 and 8 to 2 gives the output
l

12

Solution :
1
A 0

2
B 0

3
C 0

4
1

5
+ 1

6 + +
1

7 = [ + + ]
0

0
0 0 1 1 1 1

0
1 1 0 0 1 1

1
0 1 0 1 0 1

1
0 0 1 1 0 0

1
0 0 1 1 1 1

1
0 1 1 1 1 1

0
0 1 0 0 1 1

The truth table is as shown above. Columns 1, 2 and 3 give all the possible combinations of A, B and C. Column 4 is and is the opposite to column 2. Column 5 is the or-function applied to columns 1 and 4, giving (A + ). Column 6 is the or-function applied to column 3 and 5 giving C + (A + ). The output is given in column 7 and is obtained by applying the and-function to columns 2 and 6. 13

Example 4
Construct a Truth Table for the logical functions at points C, D and Q in the following circuit.

14

Solution :

From the truth table above, column C represents the output function from the NAND gate and 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.

15

Example 5
Find the Boolean algebra expression for the following system.

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 + . 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 on the next slide) :
16

Solution :

The output of the system is given as

Q = (A . B) + ( + )

17

Laws of Boolean Algebra

Associative (A . B) . C = A . (B. C) (A + B) + C = A + (B+C)

Commutative A.B=B.A A+B=B+A

Distributive A . (B + C) = A . B + A . C

A + (B . C) = (A + B) . (A + C)
18

Rules of Boolean Algebra

19

Prepared by : Department of General Studies (Mathematics) Brunei Polytechnic 2012

Lecturers :
Abdul Nafri H. Hussin Chan Koo Kiat Hamizah Md. Taha Kam Boon Long, Lim Li Yan, Lim Ting Hing, Mes Lina H. Husin.
20

Resources

Bird, J. (2010). Engineering Mathematics (6th Edition), Elsevier Ltd, Oxford, UK. www.kerryr.net www.eskimo.com www.livinginternet.com www.opamp_electronics.com www.asic-world.com/digital www.electroics-tutorials.ws http://www.kpsec.freeuk.com/gates.htm#nor http://www.electronics-tutorials.ws/boolean/bool_6.html

21