ECE 2310 Digital Systems

Design
Chapter 5 Boolean Algebra
 Objectives

• Understand the relationship between Boolean logic

and digital computer circuits.
• Learn how to design simple logic circuits.
• Understand how digital circuits work together to
form complex computer systems.

11/9/22 Chapter 5 Boolean Algebra 2

 Boolean Algebra

• Boolean algebra is a mathematical system for

the manipulation of variables that can have
one of two values.
– In formal logic, these values are “true” and “false.”
– In digital systems, these values are “on” and “off,”
1 and 0, or “high” and “low.”
• Boolean expressions are created by
performing operations on Boolean variables.
– Common Boolean operators include AND, OR, and
NOT.

11/9/22 Chapter 5 Boolean Algebra 3

 Boolean Algebra

• A Boolean operator can be

completely described using a
truth table.
• The truth table for the Boolean
operators AND and OR are
shown at the right.
• The AND operator is also known
as a Boolean product. The OR
operator is the Boolean sum.

11/9/22 Chapter 5 Boolean Algebra 4

 Boolean Algebra

• The truth table for the

Boolean NOT operator is
shown at the right.
• The NOT operation is most
often designated by an
overbar. It is sometimes
indicated by a prime mark
( ‘ ) or an “elbow” ().

11/9/22 Chapter 5 Boolean Algebra 5

 Boolean Algebra

• A Boolean function has:

• At least one Boolean variable,
• At least one Boolean operator, and
• At least one input from the set {0,1}.
• It produces an output that is also a member of
the set {0,1}.

Now you know why the binary numbering system is so handy in digital

systems.

11/9/22 Chapter 5 Boolean Algebra 6

 Boolean Algebra

• The truth table for the

Boolean function:

is shown at the right.

• To make evaluation of the
Boolean function easier,
the truth table contains
extra (shaded) columns to
hold evaluations of
subparts of the function.
11/9/22 Chapter 5 Boolean Algebra 7
 Boolean Laws

• Most Boolean identities/axioms/facts have an AND

(product) form as well as an OR (sum) form
(duality). We give our identities using both forms.
Our first group is rather intuitive:

11/9/22 Chapter 5 Boolean Algebra 8

 Boolean Laws

• Our second group of Boolean identities should be

familiar to you from your study of algebra:

Chapter 5 Boolean Algebra

11/9/22 9
 Boolean Laws

• Our last group of Boolean identities are perhaps the

most useful.
• If you have studied set theory or formal logic, these
laws are also familiar to you.

11/9/22 Chapter 5 Boolean Algebra 10

 Boolean Algebra

• Sometimes it is more economical to build a

circuit using the complement of a function (and
complementing its result) than it is to implement
the function directly.
• DeMorgan’s law provides an easy way of finding
the complement of a Boolean function.
• Recall DeMorgan’s law states:

11/9/22 Chapter 5 Boolean Algebra 11

 Logic Gates

• We have looked at Boolean functions in abstract

terms.
• In this section, we see that Boolean functions are
implemented in digital computer circuits called gates.
• A gate is an electronic device that produces a result
based on two or more input values.
– In reality, gates consist of one to six transistors, but digital
designers think of them as a single unit.
– Integrated circuits contain collections of gates suited to a
particular purpose.

11/9/22 Chapter 5 Boolean Algebra 12

11/9/22 Chapter 5 Boolean Algebra 13
 Logic Gates

• The three simplest gates are the AND, OR, and NOT
gates.

• They correspond directly to their respective Boolean

operations, as you can see by their truth tables.
11/9/22 Chapter 5 Boolean Algebra 14
 Logic Gates

AND GATE OR GATE

1 AND 0 = 0 1 OR 0 = 1

11/9/22 Chapter 5 Boolean Algebra 15

 Logic Gates

• Another very useful gate is the exclusive OR

(XOR) gate.
• The output of the XOR operation is true only when
the values of the inputs differ.

Note the special symbol  for the XOR

operation.

11/9/22 Chapter 5 Boolean Algebra 16

 Logic Gates

XOR GATE XOR GATE

1 XOR 0 = 1 1 XOR 1 = 0

11/9/22 Chapter 5 Boolean Algebra 17

 Logic Gates

• NAND and NOR

are two very
important gates.
Their symbols and
truth tables are
shown at the right.

11/9/22 Chapter 5 Boolean Algebra 18

 Logic Gates

• NAND and NOR

are known as
universal gates
because they are
inexpensive to
manufacture and
any Boolean
function can be
constructed using
only NAND or only
NOR gates.
11/9/22 Chapter 5 Boolean Algebra 19
 Logic Gates

• Gates can have multiple inputs and more than

one output.
– A second output can be provided for the complement
of the operation.
– We’ll see more of this later.

11/9/22 Chapter 5 Boolean Algebra 20

 Digital Components

• The main thing to remember is that

combinations of gates implement Boolean
functions.
• The circuit below implements the Boolean
function:

We simplify our Boolean expressions so that we can create simpler

circuits.

11/9/22 Chapter 5 Boolean Algebra 21

 Combinational Circuits

• We have designed a circuit that implements the

Boolean function:

• This circuit is an example of a combinational logic

circuit.
• Combinational logic circuits produce a specified
output (almost) at the instant when input values
are applied.
– In a later section, we will explore circuits where this is
not the case.

11/9/22 Chapter 5 Boolean Algebra 22

 Proof of x+x=x
• We can only use
Huntington postulates:

• Show that x+x=x.

x+x = (x+x)·1
= (x+x)(x+x’)
=xx+xx’+xx+xx’
= x+xx’
= x+0
=x
Q.E.D.
11/9/22 Chapter 5 Boolean Algebra 23
 Proof of x·x=x
• Similar to previous
proof

• Show that x·x = x.

x·x = xx+0
= xx+xx’
= x(x+x’)
= x·1
=x
Q.E.D.
11/9/22 Chapter 5 Boolean Algebra 24
 Proof of x+1=1
• Postitulate: x + 1 = 1
x + 1 = 1 ． (x + 1)
=(x + x')(x + 1)
= x + x' 1
= x + x'
=1

11/9/22 Chapter 5 Boolean Algebra 25

 Absorption Property

• Theorem : x + xy = x ． 1 + xy
= x (1 + y)
= x (y + 1)
=x．1
=x

• Theorem : x (x + y) = x by duality

Chapter 5 Boolean Algebra

11/9/22
26
 By means of truth table (another way to prove )

x y xy x+xy

0 0 0 0

0 1 0 0

1 0 0 1

1 1 1 1

11/9/22 Chapter 5 Boolean Algebra 27

 DeMorgan’s Theorem
• Theorem (x + y)’ = x’y’
• Theorem (xy)’ = x’ + y’
• By means of truth table

x y x’ y’ x+y (x+y) x’y’ xy x’+y' (xy)’

’
0 0 1 1 0 1 1 0 1 1
0 1 1 0 1 0 0 0 1 1
1 0 0 1 1 0 0 0 1 1
1 1 0 0 1 0 0 1 0 0

Chapter 5 Boolean Algebra

11/9/22
28
 Consensus Theorem
1. xy + x’z + yz = xy + x’z
2. (x+y)•(x’+z)•(y+z) = (x+y)•(x’+z) -- (dual)
• Proof:
xy + x’z + yz = xy + x’z + (x+x’)yz
= xy + x’z + xyz + x’yz
= (xy + xyz) + (x’z + x’zy)
= xy + x’z
QED (2 true by duality).

11/9/22 Chapter 5 Boolean Algebra 29

 Canonical and Standard Forms

Minterms and Maxterms

• A minterm (standard product): an AND term consists of all
literals in their normal form or in their complement form.
– For example, two binary variables x and y,
• xy, xy', x'y, x'y'
– It is also called a standard product.
– n variables can be combined to form 2n minterms.
• A maxterm (standard sums): an OR term consists of all literals
in their normal form or in their complement form.
– It is also call a standard sum.
– 2n maxterms.
– E.g. x+y, x+y’
11/9/22 Chapter 5 Boolean Algebra 30
 Minterms and Maxterms
 Each maxterm is the complement of its corresponding
minterm, and vice versa.

11/9/22 Chapter 5 Boolean Algebra 31

 Conversion between Canonical Forms

• The complement of a function expressed as the sum of minterms

equals the sum of minterms missing from the original function.
– F(A, B, C) = S(1, 4, 5, 6, 7) same as F(A, B, C) = m(1, 4, 5, 6, 7)
– Thus, F'(A, B, C) = S(0, 2, 3)
– By DeMorgan's theorem
F(A, B, C) = P(0, 2, 3)
F'(A, B, C) =P (1, 4, 5, 6, 7)
– mj' = Mj
– Sum of minterms = product of maxterms
– Interchange the symbols S and P and list those numbers missing from the
original form
• S of 1's
• P of 0's
11/9/22 Chapter 5 Boolean Algebra 32
 • Example
– F(x, y, z) = S(1, 3, 6, 7)
– F(x, y, z) = P (0, 2, 4, 6)

11/9/22 Chapter 5 Boolean Algebra 33

 Standard Forms

• Standard forms: the terms that form the

function may obtain one, two, or any number
of literals.
– Sum of products (SOP): F1 = y' + xy+ x'yz'
– Product of sums (POS): F2 = x(y'+z)(x'+y+z')
– F3 = A'B'CD+ABC'D'

11/9/22 Chapter 5 Boolean Algebra 34