Exercise 2 - Simplification of Boolean Expressions For Efficient Design Logic
Exercise 2 - Simplification of Boolean Expressions For Efficient Design Logic
Exercise 2 - Simplification of Boolean Expressions For Efficient Design Logic
EXAMPLE ANSWERS
Question 1. [ 2 marks ]
1. Determine by means of a truth table the validity of DeMorgan’s theorem for three variables:
(ABC)’ = A’ + B’ + C’.
Noting that the values in the last two columns are the same for all rows (ie. all combinations possible
of 0 and 1), DeMorgan’s theorem for three variables has been shown to be valid. This is an example
of Perfect Inductive proof using truth tables.
2. List the truth table of a three-variable exclusive-OR (sometimes called ‘odd’) function:
D = A x B x C, where x denotes the XOR operator.
A B C AxB AxBxC
0 0 0 0 0
0 0 1 0 1
0 1 0 1 1
0 1 1 1 0
1 0 0 1 1
1 0 1 1 0
1 1 0 0 0
1 1 1 0 1
Note that the values in the last (rightmost) column are 1 if the total number of 1’s in the set {A,B,C} is
ODD – otherwise, if the total 1’s is even, the value is 0. For this reason, the three variable XOR operator
is called the ODD function.
Question 2. [ 5 marks ]
Simplify the following expressions using Boolean algebra. In each case, state the Axiom (ie. Postulate)
or Theorem being applied at each step.
For the answers below, we refer to the following Postulates and Theorems (see lecture notes):
P1: Closure: There exists x,y in B such that two independent operations, . (dot) and + (plus) are defined:
x+y x.y
P2: Identity: There exist identity elements 0,1 in B relative to the operations + and . , such that for every
x in B:
0+x = x+0 = x 1.x = x.1 = x
P3: Commutativity: The operations + and . are commutative for all x,y in B:
x + y = y + x x.y = y.x
P4: Distributivity: Each operation + and . is distributive over the other; that is, for all x,y,z in B:
x.(y+z) = x.y + x.z x+(y.z) = (x+y).(x+z)
P5: Complementation: For every element x in B there exists an element ~x, called the complement of x,
satisfying:
x + ~x = 1 x.~x = 0
P6: Existence: There exist at least two elements x,y in B such that x ≠ y.
T2: For each X in B: X + 1 = 1 X.0=0
a. A + AB
Final answer: A
b. AB + AB’
Final answer: A
c. A’BC + AC
Final answer: (B+A)C = (A+B)C = C(A+B) etc (all similar forms are equivalent).
d. A’B + ABC’ + ABC
Final answer: B
e. AB + A(CD + CD’)
Final answer: A(B + C) NOTE: This answer is simpler than the second last line above due
to the fact that the number of operations is only 2 (one OR, one AND) in the last line, versus 3
(one OR, two AND) in the second last line.
Final answer: 0 NOTE: It is interesting (to say the least) that a complicated circuit design
involving many inputs may simplify to a very simple circuit, as in this case where the output is
0 regardless of the inputs.
Question 3. [ 3 marks ]
a. (A + B)’(A’ + B’)’ = 0
b. A + A’B + A’B’ = 1
NOTE: This example is notably inefficient in how a higher order theorem, such as
deMorgan’s theorem, is used to get the result. The same result could obviously have been
achieved in fewer steps by applying the postulates directly, or simpler theorems.
Before beginning, note that F = (X’ + XZ’)Y = (X’+Z’)Y (see examples above).
© All information on this website is Copyright © 2010 by Robert D. Kent. All rights reserved.