EE241: SPRING 2007 – FINAL EXAM
1/7
University of California
College of Engineering
Department of Electrical Engineering
and Computer Sciences
B. Nikoli
ć
Tuesday, May 8, 2007.
3:40-5:00pm
EE241—SPRING 2007: FINAL EXAM
NAME
Last
First
GRAD/UNDERGRAD
Problem 1:
Problem 2:
Total:

This
** preview**
has intentionally

**sections.**

*blurred***to view the full version.**

*Sign up*
EE241: SPRING 2007 – FINAL EXAM
2/7
PROBLEM 1. (20 pts) Adders.
In this problem, we will examine some properties of carry-lookahead adders.
a)
(5pts) Conventional generate equation for a 4-bit group, from bit position 0 to bit
position 3 is given by:
0
1
2
3
1
2
3
2
3
3
0
:
3
g
p
p
p
g
p
p
g
p
g
G
+
+
+
=
.
If this equation
is
used
to compute
G
3:0
from primary inputs
a
0
,
b
0
,
a
1
,
b
1
,
a
2
,
b
2
,
a
3
,
b
3
, what
would be the tallest stack of NMOS devices in a footless domino implementation
of this gate?