First Name:
______________________
Last Name:
______________________
HOMEWORK 9 – GATE MAPPING
This is an individual assignment. Discussion on a high level with your colleagues is encouraged. However, make
sure the work you include here is your own work. When in doubt, ask a TA or the instructor. If you are not sure
what constitutes academic dishonesty, please refer to the AISC web site: https://aisc.uci.edu/.
This homework covers:
Logic Gates
Circuit Analysis
Reflection
PROBLEM 1 – NAND NAND NAND
In this example, we converted the ci+1 output equation of a full adder from the lecture slides to all NAND (and NOT)
format using Boolean transformations. Please do the same for the si output equation of a full adder.
ci+1
= ((c(x’y’)’)’(xy)’)’
si
=…
Digital Design 101 Homework
Page 1 of 2
PROBLEM 2 – CIRCUIT ANALYSIS
Now, please draw out the new full adder circuit from our new equations (include both si and ci+1).
Circuit:
Cost:
_____ transistors
Delay of ci to ci+1:
Delay of ci to si:
Delay of xi,yi to ci+1:
Delay of xi,yi to si:
_____ ns
_____ ns
_____ ns
_____ ns
PROBLEM 3 – REFLECTION TIME
From the NAND full adder implemented in this homework, the results should be (we at least showed this was the
case for ci+1) faster & cheaper than the lecture slide implementation. If this is so, why do you think we didn’t just
start w/ the better implementation instead of the one we have in the lecture slides?
Answer: ______________
Digital Design 101 Homework
Page 2 of 2