Boolean Expressions,

Universal Gates and

Truth-Tables
 A large Boolean Logic Expression can often be simplified to a simpler and
shorter Boolean Logic Expression. This is done by applying the laws and
rules of Boolean Algebra.

𝐀𝐁 + 𝐀 𝐁 + 𝐂 +𝐁 𝐁+𝐂
 Using Boolean algebra techniques, simplify this expression:

𝐁 + 𝐀𝐂
This can be simplified to:
***Applying rules of Boolean algebra
and
DeMorgan’s Theorem show that
i) MN+𝐌𝐎 + 𝐌𝐍ഥ𝐎 𝐌𝐍 + 𝐎
=𝟏
ii) 𝐀ഥ𝐁𝐂ത + 𝐀ഥ𝐁𝐂 + 𝐀𝐁𝐂ത+ 𝐀𝐁𝐂 = 𝐁
Universal Gates
 Although we can implement any circuit with AND/OR/NOT, we can
also implement any circuit with only NAND or NOR gates.
 We might want to do this because of technology considerations, that
is, these gates might be cheaper to implement in silicon or they might
be the only type of gates we have available.
 Since we can always use only NAND or NOR gates, these gates are
sometimes called universal gates.
 The “trick” (if you want to call it that) is to see that we can implement
the three basic gates (AND, OR, NOT) in terms of NAND or NOR gates.
Universal Property of NAND and NOR gate
The NAND gate as a Universal logic gate:

• 1) One NAND gate used as an inverter (NOT gate):

• 2) Two NAND gates used as an AND gate

• ) Three NAND gates used as an OR gate

The NOR gate as a Universal logic gate:

• 1) One NOR gate used as an inverter (NOT gate):

• 2) Two NOR gates used as an OR gate:

• 3) Three NOR gates used as an AND gate:

Steps for Construction of Logic
circuits Using Universal Gates
1)First construct the logic expression using basic gates ( AND/OR/NOT),
2)Replace each basic gate with its equivalent universal gate
implementation,
3)Cancel two consecutive NOT gates (according to Boolean algebra),
4)Redraw the final circuit.
Example: Implement the following expression with (a) NAND gates ONLY, (b) NOR gates ONLY.
Y=(AB’+C)’D+E
Solution:
Implementation using NAND gates ONLY:

i) Implementation with Basic gates:

(ii) Replace each basic gate with its equivalent NAND gate implementation from Table 1.

(iii) Cancel two consecutive NOT equivalent gates (according to Boolean algebra).
(iv)Redraw the final circuit

(b) Implementation using NOR gates ONLY:

(i) Implementation with Basic gates:

(ii) Replace each basic gate with its equivalent NOR gate implementation from Table 1.

(iii) Cancel two consecutive NOT equivalent gates (according to Boolean algebra).
(iv)Redraw the final circuit.
 Sum of Products: A Product is defined as a term consisting of products of the
literals. When two or more products are summed in a Boolean expression, it is
called the Sum- of-Products (SOP).
𝐀 + 𝐀ഥ𝐁 + 𝐁𝐂

product terms. Each of the products are called min terms (𝐦𝐢) .
 Standard SOP: It is an expression where all the variables are present in each

𝐀𝐁𝐂 + 𝐀𝐁𝐂 + 𝐀𝐁𝐂

 Product of Sum: A Sum is defined as a term consisting of sum of the literals.
When two or more sum terms are multiplied in a Boolean Expression, it is called

(𝐁 + 𝐂)(𝐀 + 𝐁)
the Product-of- Sum (POS).

 Standard POS: It is an expression where all the variables are present in each

Each sum terms are called max terms (𝐌𝐢).

sum terms.

(𝐀 + 𝐁 + 𝐂)(𝐀 + 𝐁 + 𝐂)
 Minterms and
Maxterms
° Each variable in a Boolean expression is a literal
° Boolean variables can appear in normal (x) or complement form (x’)
° Each AND combination of terms is a minterm
° Each OR combination of terms is a maxterm

For example: For example:

Minterms Maxterms

x y z Minterm x y z Maxterm
0 0 0 x’y’z’ m0 0 0 0 x+y+z M0
0 0 1 x’y’z m1 0 0 1 x+y+z’ M1
… …
1 0 0 xy’z’ m4 1 0 0 x’+y+z M4
… …
1 1 1 xyz m7 1 1 1 x’+y’+z’ M7

14
 Conversion of SOP to Standard SOP
 Step1: Multiply each of the non-standard terms with a term made up of the sum
missing
of the variable and its complement. This do not change the function as we are
just
multiplying
 Step2: by step
Repeat 1. 1 until all the non-standard terms become standard terms.
 Conversion of POS to Standard POS
 Step1: Add to each non-standard product terms a term made up of the product of
the missing variable and its complement. This does not change the expression as

 Step2: Apply rule 12: 𝐀 + 𝐁𝐂 = (𝐀 + 𝐁)(𝐀 + 𝐂)

we are just adding a 0.

 Step3: Repeat step 1 until all the sum terms contain all the variable in the
domain.
 The sum-of-product (SOP) form
When two or more product terms are summed by Boolean addition. the resulting
expression is a sum-of-products (SOP). Some examples are

Conversion of a General Expression to SOP Form

17
 The product of sum (POS) form

When two or more sum terms are multiplied, the resulting expression is a
product-of-sums (POS). Some examples are

18
The Standard SOP Form

19
The Standard POS Form
: Add to each nonstandard term.

20
Converting Standard SOP to Standard POS

21
BOOLEAN EXPRESSIONS AND TRUTH TABLES
All standard Boolean expressions can be easily converted into truth table format
using binary values for each term in the expression. The truth table is a common
way of presenting, in a concise format, the logical operation of a circuit. Also.
standard SOP or POS expressions can be determined from a truth table. You will
find truth tables in data sheets and other literature related to the operation of
digital circuits.
Converting SOP Expressions to Truth Table Format

22
Converting POS Expressions to Truth Table Format

23
24
 Textbooks:

 [1] Thomas L. Floyd, “Digital Fundamentals”

11th
edition, Prentice Hall.
 [2] M. Morris Mano, “Digital Logic &
Computer Design” Prentice Hall.