Question: 2 . 1 0 a - c and e 2 . 1 0 Suppose we would like to build function Y = 2 x +

2.10a-c and e 2.10 Suppose we would like to build function Y=2x+3 where
X denotes a 3-bit unsigned value (x2x10)2 and Y=y4..y0
is a 5-bit value in hardware. Construct its truth table where
input bits are x2,x1, and x0 and output bits are y4 through
y0. Then do the following for output y2(you may repeat
this for the other outputs):
a. Determine the canonical SOP expression for output
bit y2.
b. Write the min-terms for y2.
c. Use K-map and find a minim
d. Draw a minimal NAND circuit for y2.
e. Compare the number of transistors required to
implement the canonical and the minimal SOP
expressions.
2.11 Repeat Problem 2.10 but this time use POS expressions for
y2.
2.12 Repeat Problem 2.10b through d but this time use 3-bit
2's complement values for x and output y4.
2.13 Repeat Problem 2.12b through d but this time use POS
expressions for y4.
2.14 Find a minimal SOP expression for each of the following
functions using K-maps:
a.f(w,x,y,z)=(0,2,8,10)+d(12,14)
b.g(a,b,c,d)=(5,7,13,15)+d(6,14)
c.h(w,x,y,z)=||(0,2,8,10)+||d(12,14)
d.t(a,b,c,d)=||(5,7,13,15)+||d(6,14)
2 . 1 0 a - c and e 2 . 1 0 Suppose we would like

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!