11 March 2011

Computer Systems 214

Tutoriaal 3 Tutorial 3
Boolse Algebra / Boolean Algebra
Vereenvoudig die volgende logiese uitdrukkings algebraies. Dui met elke stap aan van watter indentiteite u gebruik maak: Simplify the following logic expressions algebraically. With each step, indicate which identities are used. 1. f = x1 x2 x3 + x1 x2 x3 + x1 x2 x3 + x1 x2 x3 2. g = (x + y + z)( + y + z)( + y + z) x x 3. h = xy + xyz + xz + xy z y z 4. i = (x1 + x2 + x3 )(x1 + x2 + x3 )(x1 + x2 + x3 )

Venn Diagramme / Venn Diagrams

Gebruik Venn Diagramme om die volgende te bewys: Use Venn Diagrams to prove the following: 1. (x1 + x2 + x3 )(x1 + x2 + x3 ) = x1 + x2

Karnaugh Diagramme / Karnaugh Diagrams

(a) Vind die minimum som-van-produkte vorms van die volgende funksies deur van Karnaugh diagramme gebruik te maak. Gebruik dan net NEN-hekke om die funksie voor te stel. Die NEN-Hekke mag enige hoeveelheid intrees he. Find the minimum sum-of-products forms of the following functions by using Karnaugh diagrams. Write the function using only NAND-gates. The NAND-gates can have any amount of inputs. 1. f (w, x, y, z) = m(0, 1, 2, 7, 8, 11) + d(4, 9, 10) 2. f (x1 , x2 , x3 , x4 ) = M (0, 1, 2, 4, 5, 7, 8, 9, 10, 12, 14, 15)

Department of Electrical and Electronic Engineering Stellenbosch University

11 March 2011

Computer Systems 214

(b) Vind die minimum som-van-produkte vorms van die volgende waarheidstabel deur van Karnaugh diagramme gebruik te maak. Gebruik dan net NEN-hekke om die funksie voor te stel. Die NEN-hekke mag enige hoeveelheid intrees he. Find the minimum sum-of-products forms of the following truth table by using Karnaugh diagrams. Write the function using only NAND-gates. The NAND-gates can have any amount of inputs. x1 0 0 0 0 1 1 1 1 x2 0 0 1 1 0 0 1 1 x3 0 1 0 1 0 1 0 1 f 1 1 0 0 1 1 1 0

(c) Vind die minimum SOP en POS funksies deur van Karnaugh diagramme gebruik te maak. Wenk: Vind waar die funksie 0 is deur gebruik te maak van die nulle in die diagram en werk dan die inverse uit om die POS te kry. Find the minimum SOP and POS function using Karnaugh diagrams. Hint: Find where the function is 0 by using the zeroes in the map and then invert to nd the POS implementation. 1. f (w, x, y, z) = m(2, 4, 5, 7, 8) + d(0, 6, 13, 15)

Department of Electrical and Electronic Engineering Stellenbosch University

11 March 2011

Computer Systems 214

Getalle Stelsels / Number Systems

(a) Die volgende hexadesimale getalle is in 2s komplement formaat. Skryf die desimale waarde van die getalle neer. The following hexadecimal numbers are in 2s complement format. Calculate the decimal values D816 (8 bisse/8 bits) 7B16 (8 bisse/8 bits) C016 (8 bisse/8 bits) 3F16 (8 bisse/8 bits) (a) Doen die volgende berekeninge deur van binre rekenkunde gebruik te e maak. Gebruik die 2s komplement voorstelling vir negatiewe getalle. Toets vir oorvloei gegee dat die beskikbare bisse aangedui word in hakies. Verskaf die nale antwoord weer in die oorspronklike basisgetal. Vir die vaste punt nommers moet die binre punt posisie gekies word sodat albei nommers reg e voorgestel kan word. Perform the following calculations using binary arithmetic. Use the 2s complement representation for negative numbers. Test for overow assuming the available number of bits as indicated in parentheses. Convert the nal answer back to the original base number representation. For the xed point number the binary point should be placed so that both numbers can be represented correctly 1. 2310 10510 (8 bisse / 8 bits) 2. 5B16 + A316 (8 bisse / 8 bits) 3. 10910 + 2510 (8 bisse / 8 bits) 4. (3 5 )10 (7 1 )10 (8 bisse vastepunt / 8 bits xed point) 8 2
11 5. ( 5 )10 + ( 16 )10 (5 bisse vastepunt / 5 bits xed point) 8

(b) Covert the following 12-bit oating point numbers (1-bit sign,5-bit exponent,6-bit mantissa - Based on the IEEE 754 Standard) to their decimal equivalent. Hint: Remember that E = 00000 and E = 11111 has special meanings! 1. (111010011001)2 3
Department of Electrical and Electronic Engineering Stellenbosch University

11 March 2011

Computer Systems 214

2. (000000011000)2 3. (011111000000)2 4. (673)16 5. (F 80)16 6. (9DA)16

Kombinasie Bane / Combinational Circuits

(a) Gebruik Shannon se teorema om die funksie f = wz + wyz + xy + x xz + wx te implementeer met slegs 2-tot-1 multipleksers. Die veranderlikes (w, w, x, x, y, y , z, z ) is beskikbaar by die ingang. Pas Shannon in alfabetiese volgorde van die veranderlikes toe. Teken die stroombaandiagram. Use Shannons theorem to implement the function f = wz + wyz + xy + xz + wx with x only 2-to-1 multiplexers. The variables (w, w, x, x, y, y , z, z ) are available at the input. Apply Shannon in alphabetical order of the variables. Draw the circuit diagram. (b) Gebruik Shannon se teorema om die funksie f = wz +wx+wy+wz+yz x met n 4-tot-1 multiplekser en logiese hekke te implementeer. Pas Shannon in alfabetiese volgorde van die veranderlikes toe. Teken die stroombaandiagram. Use Shannons theorem to implement the function f = wz + wx + x wy + wz + yz with a 4-to-1 multiplexer and logic gates. Apply Shannon in alphabetical order of the variables. Draw the circuit diagram. (c) Vind n manier om die volgende twee rekenkundige vergelyking funksies gelyktydig te implementeer deur slegs gebruik te maak van n 4-tot-2 prioriteit enkodeerder, n EN hek, en n NIE hek. Teken die stroombaan diagram en dui die intreeseine w3 , w2 , w1 en w0 en die uittreeseine f en g duidelik daarop aan. Find a way to implement the following two arithmetic comparison functions simultaneously by using only a 4-to-2 priority encoder, an AND gate, and a NOT gate. Draw the circuit diagram and clearly indicate the input signals w3 , w2 , w1 and w0 and the output signals f and g. f (w3 , w2 , w1 , w0 ) = 1 f (w3 , w2 , w1 , w0 ) = 0 g(w3 , w2 , w1 , w0 ) = 1 g(w3 , w2 , w1 , w0 ) = 0 4 when w3 w2 w1 w0 >= 4 (w3 = M SB, w0 = LSB) otherwise when w3 w2 w1 w0 = 0 (w3 = M SB, w0 = LSB) otherwise
Department of Electrical and Electronic Engineering Stellenbosch University

11 March 2011

Computer Systems 214

(d) Doen n gedeeltelike ontwerp vir n volsommeerder. Die baan moet twee bisse xi en yi asook n oordrag-in bis ci bymekaar tel om n som bis si en n oordrag-uit bis ci+1 te lewer. Skryf die waarheidstabel vir die drie intreeseine ci , xi en yi en die twee uittreeseine ci+1 en si . Vind die minimum som-van-produkte funksie vir die oordrag-uit bis ci+1 deur gebruik te maak van n Karnaugh diagram. Do a partial design for a full-adder. The circuit should add two bits xi and yi as well as a carry-in bit ci to produce the sum bit si and the carry-out bit ci+1 . Write the truth table for the three input signals ci , xi and yi and the two output signals ci+1 and si . Find the minimum sum-of-products function for the carry-out bit ci+1 by using a Karnaugh map.

Prakties / Practical
Analiseer die werking van die volgende CMOS logika transistorbaan deur die gegewe tabel te kopieer na jou toetsboek en te voltooi. Vir elke kombinasie van die intreeseine Vx1 en Vx2 dui die toestand (AAN of AF) van elke transistor aan, en die spanning by die uitreesein Vf . Watter logiese funksie word deur hierdie transistorbaan geimplementeer? Neem aan die transistors is ideal i.e. geen aan-weerstand nie. Analyse the operation of the following CMOS logic transistor circuit by copying and completing the given table in your test book. For each logical combination of the input signals Vx1 and Vx2 indicate the state (ON or OFF) of each transistor, and the voltage at the output signal Vf . Which logic function does this transistor circuit implement? Assume that the transistors are ideal i.e. no on-resistance.

Department of Electrical and Electronic Engineering Stellenbosch University

11 March 2011

Computer Systems 214

Figure 1: CMOS Transistor Circuit

Department of Electrical and Electronic Engineering Stellenbosch University