Week-Two Lecture Notes
DIGITAL ELECTRONICS: E7-DIE-14
Truth Table:
The truth table can be used to represent a Boolean function. The truth table contains a
combination of 1’s and 0’s for the binary variables. Furthermore, the truth table provides the
value of the Boolean function as 1 or 0 for each combination of the input binary variables.
The truth table below provides the Boolean function for Q = AB + C. In the truth table below
if A = 1, B = 1 𝑎𝑛𝑑 C = 0, Q = 0.0 + 0 = 0. The truth table contains three input variables
and one output variable (𝑄). A Boolean function can also be represented in terms of logic
circuit/diagram. The circuit below is for Q(A, B. C) = AB + C. The Boolean expression
Q(A, B. C) = AB + C contains two terms, 𝐴̅𝐵 𝑎𝑛𝑑 𝐶, which are inputs to logic gates. Each
term may include a single or multiple variables, called ‘literals’, which may or may not be
complemented. For example, Q = AB + C contains three literals, 𝐴̅, 𝐵 𝑎𝑛𝑑 𝐶. Note that a
variable and its complement are both called literals. For two variables the literals are A, B,
A and B.
Truth table for Q = AB + C
Three Boolean variables Q(A, B. C) = AB + C
2 = 8𝑟𝑜𝑤𝑠
Boolean functions can be simplified by using the rules (identities) of Boolean algebra. This
allows one to minimise the number of gates in a logic circuit, which reduces the cost of
implementing a logic circuit.
Here is a list of Theorem of Boolean Properties (Boolean Identities), that are useful in
simplifying Boolean expressions:
1. a. A + 0 = A b. A. 1 = A
2. a. A + A = 1 b. A. A′ = A
3. a. A + A = A b. A. A = A
4. a. A + 1 = 1 b. A. 0 = 0
5. Involution: (A)′ = A
6. a. Commutative: A + B = B + A b. A. B = B. A
7. a. Associative: A + (B + C) = (A + B) + C b. A. (B. C) = (A. B). C
8. a. Distributive: A(B + C) = AB + AC b. A + B. C = (A + B). (A + C)
9. a. DeMorgan: (A + B) = AB b. (A. B) = A + B′
10. a. Absorption: A + AB = A b. A. (A + B) = A
For example, consider identity 4. Relation 4a is the dual of relation 4b because the AND in the
expression is replaced by OR and then, 0 by 1.
The duality principle of Boolean expression is unchanged if the dual of both sides of the equal
sign is taken. Consider, for example, the Boolean functions.
Q = B + AB therefore 𝑄 = 𝐵 . (A + 1)= 𝐵. The dual of Q,
𝑄 = 𝐵 . (𝐴̅ + 𝐵 )
𝑄 = 𝐵 . 𝐴̅ + 𝐵 . 𝐵 = 𝐵 𝐴̅ + 𝐵
= 𝐵 + 𝐴̅. 𝐵
=(1 + 𝐴̅). 𝐵 = 𝐵
Identity 8b: A + B. C = (A + B). (A + C) is very useful in manipulating Boolean expression.
This identity can be verified by means of a truth table as follows:
De Morgan’s Theorem can be expressed as in general form for n variables as follows:
A + B + C + D + ⋯ = A. B. C. D ….
A. B. C. D … = A + B + C + D…..
The logic gates except for the inverter can have more than two inputs if the logic operation
performed by the gate is commutative and associative (identities 6a and 7a). For example,
the OR operation has these two properties as follows: A + B = B + A (commutative) and
(A + B) + C = A + (B + C)= A + B + C (associative). This means
a. Implementation Q = ABCD + ABCD + AB
b. Implementation of the simplified function of Q = BC + D
Implementation of Boolean function using logic gates that the OR gates inputs can be inter
changed. Thus, the OR gate can have more than two inputs. Similarly, using the identities 6(b)
and 7b, it can be shown that the AND gate can also have more than two inputs. Note that the
NOR and NAND operations, on the other hand, are commutative, but not associative.
Therefore, it is not possible to have NOR and NAND gates with more than two inputs.
However, NOR and NAND gates with more than two inputs can be obtained by using inverted
OR and inverted AND respectively. The exclusive-OR and Exclusive-NOR operations are both
commutative and associative. Thus, these gates can have more than two inputs. However,
Exclusive-OR and Exclusive-NOR gates with more than two are uncommon from a hardware
point of view.
Simplification using Boolean Identities:
Although there are no defined set of rules for minimization a Boolean expression, appropriate
identities can be used to accomplish this. Consider the Boolean function Q = ABCD +
ABCD + AB. This equation can be implemented using logic gates as shown in “a” above. The
expression can be simplified by using identities as follows:
Q = ABCD + ABCD + BC by using identity 4(a)
= BCD(A + A) + BC
= BCD(1) + BC by identity 1(b)
Assume BC = E, then BC = E
= ED + E
= (E + E). (E + D) By identity 8(b)
= (1). (E + D) = (E + D) by identity 4(a)
The simplified form is implemented using logic gates in (b) above. The logic circuit in (b)
requires only one NAND gate and an OR gate. This implementation is inexpensive compared
to the circuit of figure (a) above, both logic circuits perform the same function. The following
truth table can be used to show that the outputs produced by both circuits are equivalent:
