Lab5_Solutions_45

# Lab5_Solutions_45 - Exercise 1 Exercise 2 Exercise 3...

This preview shows pages 1–3. Sign up to view the full content.

Exercise 1 Exercise 2 Exercise 3

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Exercise 4 (25%) Adapted from problem 3.28 in the textbook. You may finish this exercise outside the lab and show your TA at the beginning of next lab session. Of course you can try to finish everything during the lab session. Now that you have implemented a full adder, you are ready to design a 2-bit by 2-bit unsigned binary multiplier. The multiplier takes two 2-bit inputs A[1:0] and B[1:0] and produces an output Y which is the product of A[1:0] and B[1:0]. The standard notation for this is: Y = A[1:0] x B[1:0] a. What is the maximum value that can be represented in 2 bits for A (A[1:0])? A[1:1] b. What is the maximum value that can be represented in 2 bits for B (B[1:0])? B[1:1] c. What is the maximum possible value of Y? 1001 d. What is the number of required bits to represent the maximum value of Y?4 bits e. Write a truth table for the multiplier described above. You will have a four-input truth table with inputs being A[1], A[0], B[1], and B[0]. f. Implement the third (3rd) bit of output,that is Y[2], from the truth table using a PLA. Extra
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 5

Lab5_Solutions_45 - Exercise 1 Exercise 2 Exercise 3...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online