Spring 2010 Name: SOLUTIONS_______________

INTRODUCTION TO DSD
Test #1
Problem 1 _______________ (20 pts.)
Problem 2 _______________ (20 pts.)
Problem 3 _______________ (20 pts.)
Problem 4 _______________ (20 pts.)
Problem 5 _______________ (20 pts.)
Total _______________ (100 pts.)

Problem 1
(i) Answer the following statements with T(rue) or F(alse) only. (Do not guess:
points
may be deducted for incorrect answers)
a) T___ Any Boolean function can be implemented using only two-input AND gates
and XNOR gates
b) T____ A dual of any Boolean function can be implemented using only two-input
AND gates and XNOR gates
c) T____ A code with Hamming distance of 3 can detect two single-bit errors
d) T____ The logical product of two different minterms mi mj = 0 if i≠j
e) F____ The logical product of two different maxterms Mi Mj = 0 if i≠j
f) T____ Complement of a Boolean expression can be obtained by interchanging
logical AND and logical OR operations, replacing each variable with its
complement, and interchanging logical 1 and 0 constants.
Grading: (a), (d), (f) - 2 pts each; (b), (c), (e) - 1 point each;
Deduct 0.5 pts for each incorrect answer.
(ii) Add the following numbers (given in decimal sign-magnitude notation) using
2’s
complement representation for binary numbers. Use the word length of 5 bits. The
n
repeat addition using 1’s complement representation.
(+0) + (-9) =
2’s comp: 00000 1’s comp: 00000
+10111 +10110
10111 10110
(-10)+10 =
2’s comp: 10110 1’s comp: 01010
+01010 +10101
100000 (discard carry out) 11111 (negative zero)
– 6 pts
3
Problem 2
Many Internal Revenue Service (IRS) tax forms and instructions utilize compound
statements
that can be interpreted as Boolean expressions with many variables. Consider the
following
excerpt from the Tax Form 1040 instructions, describing requirements for filing
US tax return for
non-resident aliens and dual-status aliens:
These rules also apply if you were a nonresident alien and both of following app
ly:
· You were married to a U.S. citizen or resident alien at the end of 2009.
· You elected to be taxed as a resident.
(a) Represent this compound statement as a Boolean expression, where the truth v
alue of
the statement F (shown in italics) is a function of the Boolean variables A, B,
C, D
such that
- A ~ You were a non-resident alien (True/False correspond to logical values 1/0
);
- B ~ You were married to a U.S. citizen at the end of 2009;
- C ~ You were married to a resident alien at the end of 2009;
- D ~ You elected to be taxed as a resident.
Show the Boolean function F(A,B,C,D) corresponding to this compound statement. D
oes
this Boolean expression correspond to SOP or POS form?
F = A (B + C) D – 6 pts
This is Product-of-Sums form – 2 pts
(b) Represent the Boolean function derived in part (a) using the simpler of (min
term or
maxterm) canonical form. (The simpler canonical form has fewest numbers of terms
).
For this function, the simpler form is the minterm canonical form:
F = A (B + C) D = ABD + ACD = ABCD + ABC’D + AB’CD
– 7 pts
4
Problem 3
(a) Prove using algebraic manipulations:
(X+Y) ( X’+Z) (Y+Z) = (X+Y) (X’+Z) – this is a dual form of consensus theorem
(X+Y) ( X’+Z) (Y+Z) = (X+Y) ( X’+Z) (Y+Z +XX’) =
=(X+Y) ( X’+Z) (Y+Z +X) (Y+Z+X’) =(X+Y) (X+Y +Z) ( X’+Z) (X’+Z+Y) =
=(X+Y) (1 +Z) ( X’+Z) (1+Y) = (X+Y) (X’+Z)
– 10 pts
(b) Prove using algebraic manipulations that: Ci (X+Y) + XY = Ci (X Å Y) + XY
(this is an expression for the output carry of a full adder)
Ci (X Å Y) + XY = Ci (X’Y + XY’) + XY = (Ci X’Y + XY) + (Ci XY’ + XY) + XY =
= Ci Y+ Ci X + XY = Ci (X+Y) + XY
– 10 pts
Note: different correct solutions are possible
5
Problem 4
Consider the Boolean function G(A,B,C,D) specified by the Karnaugh map shown bel
ow.
For this function:
(a) Give the algebraic expression for the sum-of-products form using products th
at are
‘circled’. Does this expression correspond to the min SOP form? (Explain briefly why
)
A’B’D’+ B’C’D’+ABC’+ BD+ ACD’ – this is NOT the min SOP form, since some
product terms are not prime implicants (for example, ACD’)
.
(b) List all prime implicants of this function
AB, BD, B’D’, AD’
(c) Show min two-level NOR gate implementation for this function
Using min POS form (B+D’)(A+B’+D) results in a two-level implementation (3 NOR
gates)
(d) Does your NOR gate implementation in (c) have static-1 or static-0 hazards?
(Explain). If
hazard(s) are found, show how to remove them.
2-level NOR implementation can not have static-1 hazards. This implementation al
so
does not have static-0 hazards: as can be seen from K-map, changing any single i
nput
value does not result in a transition from one sum term to another term.
Grading: (a)-(d) ~ 5 points each
00 01 11 10
00
01
11
10
1
1
1 1
1
1
1 1 1
1
AB
CD
G
6
Problem 5
A combinational network has four inputs: a, b, c, d and one output Z such that Z
=1 if and only if
the total number of input ones is two or more.
For example: if abcd = 0100 then Z=0; if abcd = 0110 then Z=1
(a) Find the minimal standard form for the output Z (a,b,c,d) using K-map – 10 pts
(b) Show the best two-level NAND or two-level NOR gate implementation for this n
etwork
(whichever is most appropriate for your solution in (a)) – 4 pts
(c) Show how to obtain the best three-level implementation for this network, by
modifying
the best two-level solution found in part (b) via algebraic manipulations. – 6 pts
(a) From K-map, min SOP: Z = ab + bd +ad +bc + ac + cd - 6 terms
min POS: Z = (a+b+d)(a+b+c)(a+c+d)(b+c+d) – 4 terms
 choose POS form as the minimal standard form
(b) since the min POS form was selected, it corresponds to two-level NOR impleme
ntation (five
NOR gates)
(c) Starting with the min POS form used in part (b):
Z = (a+b+d)(a+b+c)(a+c+d)(b+c+d) = (a + b + cd)(c + d + ab)  this corresponds to
the best
three-level implementation that can be implemented with 5 NOR gates (assuming in
puts are
available in both direct and complemented form)
ab
cd 00 01 11 10
00 0 0 1 0
01 0 1 1 1
11 1 1 1 1
10 0 1 1 1