ELS2103 Digital Systems

Introduction to Logic Circuits

Semester 1 2018/2019 9/17/2018 GFP 1
Outlines
 Variables
 Functions
 Inversion and Truth Tables.
 Syhenthesis using AND, OR, and NOT gates
 Logic Gates
 Boolean Algebra

9/17/2018 GFP 2
Overview – Canonical Forms
 What are Canonical Forms?
 Minterms and Maxterms
 Index Representation of Minterms and
Maxterms
 Sum-of-Minterm (SOM) Representations
 Product-of-Maxterm (POM)
Representations
 Representation of Complements of
Functions
 Conversions between Representations
Canonical Forms
 It is useful to specify Boolean
functions in a form that:
◦ Allows comparison for equality.
◦ Has a correspondence to the truth tables
 Canonical Forms in common usage:
◦ Sum of Minterms (SOM)
◦ Product of Maxterms (POM)
Minterms
 Minterms are AND terms with every variable
present in either true or complemented form.
 Given that each binary variable may appear
normal (e.g., x) or complemented (e.g., x), there
are 2n minterms for n variables.
 Example:Two variables (X and Y)produce
2 x 2 = 4 combinations:
XY (both normal)
X Y (X normal,Y complemented)
XY (X complemented,Y normal)
X Y (both complemented)
 Thus there are four minterms of two variables.
Maxterms
 Maxterms are OR terms with every variable
in true or complemented form.
 Given that each binary variable may appear
normal (e.g., x) or complemented (e.g., x),
there are 2n maxterms for n variables.
 Example:Two variables (X and Y) produce
2 x 2 = 4 combinations:
X + Y (both normal)
X + Y (x normal, y complemented)
X + Y (x complemented, y normal)
+ (both complemented)
X Y
For a function of n variables, a product term in which
each of the n variables appears once is called a
minterm
Index Examples – Four Variables
Index Binary Minterm Maxterm
i Pattern mi Mi
0 0000 ab c d a + b + c + d
1 0001 ab c d ?
3 0011 ? a+ b + c + d
5 0101 ab c d a + b + c + d
7 0111 ? a+ b + c + d
10 1010 ab c d a + b + c + d
13 1101 ab c d ?
15 1111 a b c d a + b + c + d
Minterm Function Example
 Example: Find F1 = m1 + m4 + m7
 F1 = x y z + x y z +x y z
x y z index m1 + m4 + m7 = F1
000 0 0 + 0 + 0 =0
001 1 1 + 0 + 0 =1
010 2 0 + 0 + 0 =0
011 3 0 + 0 + 0 =0
100 4 0 + 1 + 0 =1
101 5 0 + 0 + 0 =0
110 6 0 + 0 + 0 =0
111 7 0 + 0 + 1 =1
 Minterm Function Example
 F(A, B, C, D, E) = m2 + m9 + m17 + m23
 F(A, B, C, D, E) =

Chapter 2 - Part 1 10
Maxterm Function Example
 Example: Implement F1 in maxterms:
F1 = M0 · M2 · M3 · M5 · M6
F1 = (x+ y + z)·(x+ y + z)·(x+ y + z)
·(x + y + z)·(x + y + z)
xyz i M0  M2  M3  M5  M6 = F1
000 0 0  1  1 1  1 =0
001 1 1  1  1 1  1 =1
010 2 1  0  1 1  1 =0
011 3 1  1  0 1  1 =0
100 4 1  1  1 1  1 =1
101 5 1  1  1 0  1 =0
110 6 1  1  1 1  0 =0
111 7 1  1  1 1  1 =1
Maxterm Function Example
 F (A , B, C , D) =M 3 M 8 M11 M14
 F(A, B,C,D) =
SUM of Product (SOP) and
Product of SUM (POS)
Standard Forms
 Standard Sum-of-Products (SOP) form: equations
are written as an OR of AND terms
 Standard Product-of-Sums (POS) form: equations
are written as an AND of OR terms
 Examples:
◦ SOP: A BC + A BC + B
◦ POS: (A+ B)· (A+ B + C )·C
 These “mixed” forms are neither SOP nor POS
◦
◦ (A B + C) (A + C)
A B C + A C (A+ B)
SUM of Product (SOP) : Minterm
Example 1

The function in truth table can

Truth Table be represented as

0 0 1
0 1 1
1 0 0
1 1 1
SUM of Product (SOP)
Example 2

Simplification using Boolean Algebra

the function in truth table can be specified as

or even more simply as

Summary
SUM of Product (SOP)

Logic Circuit?
Product of SUM (POS) : Maxterm
Truth Table

0 0 1
0 1 1
1 0 0 If we complement this expression
1 1 1 using DeMorgan’s theorem, the
result is

The key point here is that

Example
Then f can be expressed as

Using the commutative property 10b and the associative property 11b

Then, using the combining property 14b, the expression reduces to

Using the shorthand notation, an alternative way of
specifying our sample function is

or more simply
Back to Problem last week

From the truth table, can you

make the:
1. The canonical sum-of-products
(SOP) expression for the
specified function?
2. The Logic Network?
Lam
p
0 0 0 0 From the truth table, can you
0 0 1 1 make the:
0 1 0 1 1. The canonical products-of-sum
0 1 1 0 (POS) expression for the
1 0 0 1 specified function?
1 0 1 0 2. The Logic Network?
1 1 0 0
1 1 1 1
 Answer

The canonical sum-of-products expression for the specified

function is
Answer

Realization for this function is in

the product-of-sums form.
Design Examples – Three-way Light Control
 Asumsi ada ruangan besar dengan tiga pintu dan disetiap
pintu anda switch untuk mengontrol lampu pada ruangan.
 Harus memungkinkan menyalakan dan mematikan lampu
dengan mengubah state salah satu switch.

9/18/2018 GFP 28
Design Examples
 Asumsi ada ruangan besar dengan tiga pintu dan disetiap
pintu anda switch untuk mengontrol lampu pada ruangan.
 Harus memungkinkan menyalakan dan mematikan lampu
dengan mengubah state salah satu switch.
 Solusi

9/18/2018 GFP 29
Design Examples – Multiplexer Circuit
 In computer systems it is often necessary to choose data from
exactly one of a number of possible sources. Suppose that there are
two sources of data, provided as input signals x1 and x2. The
valuesof these signals change in time, perhapsat regular intervals.
Thus sequencesof 0sand 1sare applied on each of the inputs x1 and
x2. We want to design a circuit that producesan output that hasthe
same value aseither x1 or x2, dependent on the value of a selection
control signal s. Therefore, the circuit should have three inputs: x1,
x2, and s. Assume that the output of the circuit will be the same as
the value of input x1 if s = 0, and it will be the same as x2 if s = 1

9/18/2018 GFP 30
Design Examples – Multiplexer Circuit

9/18/2018 GFP 31
EOF

9/17/2018 GFP 32