Topic 1

Introduction to Digital Design with SSI

[Combinational Logic Circuits]

Feb 14 2025
By Dr. Ahuna
Dr. Ahuna
 Introduction to Digital System Design
Digital System Design (DSD)
2
 Digital System Design is the process of creating electronic systems that use
digital signals to perform specific tasks.
 This process involves the design and implementation of systems that rely on
binary values (0s and 1s) to process, store, and transmit data.
 DSD is at the core of most modern electronics, such as computers, mobile
phones, smart devices, and digital communication equipment.
 Key aspects of DSD include:
 Logic Design (AND, OR, NOT)
 Combinational & Sequential Logic design
 Hardware Description Languages (HDLs)
 Design of basic microcomputer system

Dr. Ahuna
 Introduction to Digital System Design
Re-cap on Logic Simplification Techniques
3

Example 2
A SOP expression is represented by the following function:
𝑓 𝐴, 𝐵, 𝐶 = σ 𝑚 0,1,2,3,4,5,7
a) Showing all your workings, simplify this equation using Boolean Algebra
method
b) Confirm your answer in (a) using the k-map

Dr. Ahuna
 Introduction to Digital System Design
Re-cap on Logic Simplification Techniques
4

Example 2 Solution – Using Boolean Algebra

𝑓 𝐴, 𝐵, 𝐶 = σ 𝑚 0,1,2,3,4,5,7
 Boolean Algebra
𝐹 = 𝐴ҧ𝐵ത 𝐶ҧ + 𝐴ҧ𝐵𝐶 ҧ 𝐶ҧ + 𝐴𝐵𝐶
ത + 𝐴𝐵 ҧ + 𝐴𝐵ത 𝐶ҧ + 𝐴𝐵𝐶
ത + 𝐴𝐵𝐶
𝐹 = 𝐴ҧ𝐵(
ത 𝐶ҧ + 𝐶) + 𝐴𝐵(
ҧ 𝐶ҧ + 𝐶) + 𝐴𝐵(
ത 𝐶ҧ + 𝐶) + 𝐴𝐵𝐶
𝐹 = 𝐴ҧ𝐵ത + 𝐴𝐵
ҧ + 𝐴𝐵ത + 𝐴𝐵𝐶
𝐹 = 𝐴(ҧ 𝐵ത + 𝐵) + 𝐴(𝐵ത + 𝐵𝐶)
𝐹 = 𝐴ҧ + 𝐴 𝐵ത + 𝐶 = 𝐴ҧ + 𝐴𝐵ത + 𝐴𝐶
𝐹 = 𝐴ҧ + 𝐴𝐵ത + 𝐴𝐶
𝐹 = 𝐴ҧ + 𝐵ത + 𝐴𝐶
ഥ+𝑩
𝐹=𝑨 ഥ +𝑪

Dr. Ahuna
 Introduction to Digital System Design
Re-cap on Logic Simplification Techniques
5

Example 2 Solution – Using K-map

𝑓 𝐴, 𝐵, 𝐶 = σ 𝑚 0,1,2,3,4,5,7

𝐹 = 𝐴ҧ𝐵ത 𝐶ҧ + 𝐴ҧ𝐵𝐶 ҧ 𝐶ҧ + 𝐴𝐵𝐶

ത + 𝐴𝐵 ҧ + 𝐴𝐵ത 𝐶ҧ + 𝐴𝐵𝐶
ത + 𝐴𝐵𝐶

𝐴ҧ𝐵ത ҧ
𝐴𝐵 𝐴𝐵 𝐴𝐵ത

𝐶ҧ

Dr. Ahuna
 Introduction to Digital System Design
Re-cap on Logic Simplification Techniques
6

Example 2 Solution – Using K-map

𝑓 𝐴, 𝐵, 𝐶 = σ 𝑚 0,1,2,3,4,5,7

𝐴ҧ𝐵ത ҧ
𝐴𝐵 𝐴𝐵 𝐴𝐵ത

𝐶ҧ 1 1 0 1 ഥ+𝑩
𝑭=𝑨 ഥ +𝑪

C 1 1 1 1

Dr. Ahuna
 Boolean Algebra & Simplification Techniques
7
Introduction
 Switching circuits are also called logic circuits, gates circuits and digital
circuits. Switching algebra is also called Boolean algebra.
 Boolean algebra is a system of mathematical logic. It is an algebraic system
consisting of the set of elements (0,1), two binary operators called OR and
AND and unary operator called NOT.
 It is the basic mathematical tool in the analysis and synthesis of switching
circuits. It is a way to express logic functions algebraically.
 Any complex logic can be expressed by a Boolean function.
 The Boolean algebra is governed by certain well developed rules and laws.

Dr. Ahuna
 Boolean Algebra & Simplification Techniques
8
Axioms and Laws of Boolean Algebra
 Axioms or postulates of Boolean algebra are set of logical expressions that
are accepted without proof and upon which we can build a set of useful
theorems.
 Actually, axioms are nothing more than the definitions of the three basic
logic operations AND, OR and INVERTER.
 Each axiom can be interpreted as the outcome of an operation performed
by a logic gate.

Dr. Ahuna
 Boolean Algebra & Simplification Techniques
9
Axioms and Laws of Boolean Algebra
1. Complementation Laws
 The term complement simply means to invert, i.e. to changes 0s to 1s and 1s to 0s.
The five laws of complementation are as follows:

2. OR Laws
 The four OR laws are as follows

Dr. Ahuna
 Boolean Algebra & Simplification Techniques
10
Axioms and Laws of Boolean Algebra
3. AND Laws
 The four AND laws are as follows

4. Commutative Laws:-
 Commutative laws allow change in position of AND or OR variables. There are
two commutative laws.

Dr. Ahuna
 Boolean Algebra & Simplification Techniques
11
Axioms and Laws of Boolean Algebra
5. Associative Laws
 The associative laws allow grouping of variables. There are 2 associative laws.

6. Distributive Laws
 The distributive laws allow factoring or multiplying out of expressions. There are
two distributive laws.

Dr. Ahuna
 Boolean Algebra & Simplification Techniques
12
Axioms and Laws of Boolean Algebra
7. Redundant Literal Rule (RLR)

Proof:
A B 𝐴ҧ ҧ
𝐴𝐵 ҧ
𝐴 + 𝐴𝐵 A+B
0 0 1 0 0 0
0 1 1 1 1 1
1 0 0 0 1 1
1 1 0 0 1 1

Dr. Ahuna
 Boolean Algebra & Simplification Techniques
13
Axioms and Laws of Boolean Algebra
8. Indempotence Laws
 Idempotence means same value.

9. Absorption Laws:-
 There are two laws:

Dr. Ahuna
 Boolean Algebra & Simplification Techniques
14
Axioms and Laws of Boolean Algebra
9. De Morgan’s Theorems
 De Morgan’s theorem represents two laws in Boolean algebra.

Dr. Ahuna
 Boolean Algebra & Simplification Techniques
15
Axioms and Laws of Boolean Algebra
9. De Morgan’s Theorems
 De Morgan’s theorem represents two laws in Boolean algebra.

 This law states that the complement of a sum of variables is equal to the product of
their individual complements.
Dr. Ahuna
 Boolean Algebra & Simplification Techniques
16
Axioms and Laws of Boolean Algebra
9. De Morgan’s Theorems – Cont’d

 This law states that the complement of a product of variables is equal to the sum of
their individual complements.
Dr. Ahuna
 Boolean Algebra & Simplification Techniques
17
Simplification Techniques
 A discussion on techniques other than the application of laws and theorems of
Boolean algebra is carried out in this section for simplifying or more precisely
minimizing a given complex Boolean expression.
 The primary objective of all simplification procedures is to obtain an
expression that has the minimum number of terms. Obtaining an expression
with the minimum number of literals is usually the secondary objective. If
there is more than one possible solution with the same number of terms, the
one having the minimum number of literals is the choice.
 The techniques to be discussed include:
a) the Boolean Algebra method;
b) the Karnaugh map method.
 Any given expression will be either in the sum-of-products and product-of-
sums Boolean expressions form.
Dr. Ahuna
 Boolean Algebra & Simplification Techniques
18
Sum-of-Products (SOP) Boolean Expressions
 A sum-of-products expression contains the sum of different terms, with
each term being either a single literal or a product of more than one literal.
 It can be obtained from the truth table directly by considering those input
combinations that produce a logic ‘1’ at the output.
 Each such input combination produces a term. Different terms are given by
the product of the corresponding literals.
 The sum of all terms gives the expression. For example, the truth table in
Table 6.5 can be represented by the Boolean expression

 A sum-of-products expression is also known as a minterm expression.

Dr. Ahuna
 Boolean Algebra & Simplification Techniques
19
Sum-of-Products (SOP) Boolean Expressions

Dr. Ahuna
 Boolean Algebra & Simplification Techniques
20
Product-of-Sums (POS) Boolean Expressions
 A product-of-sums expression contains the product of different terms, with
each term being either a single literal or a sum of more than one literal.
 It can be obtained from the truth table by considering those input
combinations that produce a logic ‘0’ at the output. Each such input
combination gives a term, and the product of all such terms gives the
expression.
 Different terms are obtained by taking the sum of the corresponding literals.
Here, ‘0’ and ‘1’ respectively mean the uncomplemented and
complemented variables, unlike sum-of-products expressions where ‘0’ and
‘1’ respectively mean complemented and uncomplemented variables.

Dr. Ahuna
 Boolean Algebra & Simplification Techniques
21
Product-of-Sums (POS) Boolean Expressions
 To illustrate this further, consider once again the truth table in Table 6.5.
Since each term in the case of the product-of-sums expression is going to
be the sum of literals, this implies that it is going to be implemented using
an OR operation.
 Now, an OR gate produces a logic ‘0’ only when all its inputs are in the
logic ‘0’ state, which means that the first term corresponding to the second
row of the truth table will be 𝐴 + 𝐵 + 𝐶.ҧ
 The product-of-sums Boolean expression for this truth table is given by
𝐴 + 𝐵 + 𝐶ҧ . 𝐴 + 𝐵ത + 𝐶ҧ . 𝐴ҧ + 𝐵 + 𝐶ҧ . 𝐴ҧ + 𝐵ത + 𝐶ҧ .

Dr. Ahuna
 Boolean Algebra & Simplification Techniques
22
Converting a POS Expression to a SOP Expression
 Transforming the given product-of-sums expression into an equivalent
sum-of-products expression is a straightforward process.
 Multiplying out the given expression and carrying out the obvious
simplification provides the equivalent sum-of-products expression:

Dr. Ahuna
 Boolean Algebra & Simplification Techniques
23 Converting a SOP Expression to a POS Expression
 Transforming the given product-of-sums expression into an equivalent
sum-of-products expression is a straightforward process.
 Multiplying out the given expression and carrying out the obvious
simplification provides the equivalent sum-of-products expression:

Dr. Ahuna
 Boolean Algebra & Simplification Techniques
24
𝚺 and 𝚷 Representation of Logic Expressions
 Σ and Π notations are respectively used to represent sum-of-products and
product-of-sums Boolean expressions.
 Minterm expression:
𝐹 𝐴, 𝐵, 𝐶, 𝐷 = Σ𝑚 0,2,4,6,7
 Maxterm expression:
𝐹 𝐴, 𝐵, 𝐶, 𝐷 = 𝛱𝑀 0,1,3,5,8,12,14,15

Dr. Ahuna
 Boolean Algebra & Simplification Techniques
25
Examples
 Simplify the expression 𝐹 = 𝐴ҧ𝐵ത 𝐶ҧ + 𝐴ҧ𝐵𝐶 ҧ 𝐶ҧ + 𝐴𝐵𝐶
ത + 𝐴𝐵 ҧ ത + 𝐴𝐵𝐶
+ 𝐴𝐵𝐶
using the following methods:
a) Boolean Algebra
b) Karnaugh Map

Dr. Ahuna
26

Dr. Ahuna
27

Topic 1b

Combinational Logic Circuits

[Part II]

Dr. Ahuna