Professional Documents
Culture Documents
Tutorial 2
Combinational Logic Design
Principles and Practices
N.B All questions must be answered using proper digital system processes.
Switching Algebra Theorems / Omruiling Algebra Theorems
1.
(T5) X + X = 1
(T5)
X . X = 0
(T6) X + Y = Y + X
(T6)
X.Y=Y.X
(T7) (X + Y) + Z = X + (Y + Z)
(T7)
(X . Y) . Z = X . (Y . Z)
(T8) X . Y + X . Z = X . (Y + Z)
(T8)
(X + Y) . (X + Z) = X + Y . Z
(T9) X + X . Y = X
(T9)
X . (X + Y) = X
(T10) X . Y + X . Y = X
(T10) (X + Y) . (X + Y) = X
(T11) X . Y + X . Z + Y . Z = X . Y + X . Z
(T11) (X + Y) . (X + Z) . (Y + Z) = (X + Y) . (X +
Z)
(T12) X + X + .. + X = X
(T12) X . X . .. . X = X
____________________________________________________________________________________________
____________________________________________________________________________________________
____________________________________________________________________________________________
____________________________________________________________________________________________
____________________________________________________________________________________________
____________________________________________________________________________________________
____________________________________________________________________________________________
____________________________________________________________________________________________
ERS 220 Tutorial 2 2011
2.
The following figure shows a combinational logic circuit. / Die volgende figuur toon n
kombinatoriese logika stroombaan.
F=
_________________________________________________________________________________________________
_________________________________________________________________________________________________
2.2. Simplify the output equation F of the circuit using Switching Algebra Theorems. Please
indicate which Theorem, if any, is being used at each step. / Vergemaklik die afvoer vergelyking
f van die stroombaan Omruiling Algebra Theorems gebruik. Dui aan wat theorem, indien enige, tot
elke stap gebruik is.
_________________________________________________________________________________________________
_________________________________________________________________________________________________
_________________________________________________________________________________________________
_________________________________________________________________________________________________
_________________________________________________________________________________________________
_________________________________________________________________________________________________
_________________________________________________________________________________________________
3.
3.1. Complete the Truth Table. Hint: Use all input combinations. / Voltooi die waarheidstabel.
Wenk: Gebruik al toevoer kombinasies.
3.2. Determine the canonical sum for F. / Bepaal die canonical som vir F.
____________________________________________________________________________________________
3.3. Determine the canonical product for F. / Bepaal die canonical produkt vir F.
____________________________________________________________________________________________
3.4. Draw the minimised logic diagram using only 2 gates. / Teken die klein logiese diagram
gebruik slegs 2 hekke.
4.
For the sum-of-products function H below, use the Karnaugh maps to derive the minimum
sum-of-products expression. Indicate prime implicants and distinguished 1-cells. / Vir die
som-van-produkte funksie H hieronder, gebruik die Karnaugh diagram om die minimum som-vanprodukte uitdrukking af te lei. Dui aan prima implicants en kenmerkende 1-selle.
H = PQRST (0, 1, 2, 3, 4, 6, 9, 11, 12, 13, 16, 18, 19, 20, 22, 26, 27, 28, 29)
H=
_______________________________________________________________________________________
5.
For the product-of-sums function H below, use the Karnaugh maps to derive the minimum
sum-of products expression. / Vir die produk-van-somme funksie H onder, gebruik die Karnaugh
karate om af te lei die minimum som-van-produkte uitdrukking.
H=
PQRST
(0, 2, 3, 8, 10, 16, 17, 18, 19, 21, 23, 24, 26) + d(1, 5, 29, 31)
H=
______________________________________________________________________________________
6.
For the product-of-sums function H below, use the Karnaugh maps to derive the minimum
product-of-sums expression. / Vir die produk-van-somme funksie H onder, gebruik die Karnaugh
karate om af te lei die minimum produkt-van-somme uitdrukking.
H=
PQRST
(1, 3, 6, 8, 9, 10, 11, 14, 17, 19, 22, 23, 25, 27, 30, 31)
H=
______________________________________________________________________________________
7.
F1 = ABC + ABC
F2 = ABC + ABC
F3 = ABC + ABC
Design the following PLA to perform the above functions. / Ontwerp die volgende PLA om uit
te voer die boonste funksies.
10
8.
Given the following two Boolean functions. / Gegee die volgende Boolse funksies.
11
9.
Given the following Boolean function / Gegee die volgende Boolse funksie
*******************
ERS 220 Tutorial 2 2011
END / EINDE
*******************
12