Question

4) This exercise will first present the modified algorithm for computing the product of two numbers represented in twos complement with an illustrated example and then ask you to repeat for a different number pair The hardware and the flowchart for signed multiplication in twos complement representation of binary numbers will be slightly modified as follows. Use the version of the unsigned multiplication hardware which employs one double-sized register to hold the partial product and the multiplier a. When shifting right, extend the sign of the product (which is assumed to be in H:LO register pair in a MIPS machine). b. If the multiplier is negative, the last step should be a subtract and not an add. The modified hardware and the flowchart are presented below c. Any carry out from the MSB position of the HILO register following add/subtract will be ignored if 0) both the multiplicand and multplier are negative, (i) the multiplicand is negative but the multiplier is positive. Here is the modified flowchart adapted for MIPS HI:LO register pair to hold the product: Similar to Unsigned Multiplier ALU produces a Multiplicand and Hl are result is the sign of the result Start Multiplicand 32 bits 2 bits Loroj? add, sub 33-bit ALU 33 bits 32 bits First 31 iterations: HI HI+Multiplicand Last iteration: Hl Hl- Multiplicand shift right LO Control Shift Right Product (HI, LO) 1 bit write 64 bits Loro No es Done Example Consider product of 2 signed binary numbers in twos complement representation as 1100 (multiplicand) and 1101 multiplier) where both are negative with decimal equivalents of -4 and -3, respectively The product is positive and equal to 12 in decimal and 00001100 in binary in twos complement representation Assume LO has the multiplier and Hl is initialized to zeros. Then upon first time the multiplicand is added to the Hi (partial product), the HI must be sign-extended. The shifts are arithmetic shift right: the sign bit of multiplicand is inserted from left into the HI MS8 position upon arithmetic shiftright.

0 0
Add a comment Improve this question Transcribed image text
Answer #1

S tep Multpucand Product/ Muldpか dcuior 100 O0I o ooo o00 01 o1 Rshye mpuer 100 0 (t) 10.0 oI 교. Riod: Pod mcard 100001 0 10

Add a comment
Know the answer?
Add Answer to:
4) This exercise will first present the modified algorithm for computing the product of two numbers...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Multipliero = 1 Multipliero = 0 Multiplicand Shift Left 1. Test Multiplero 64 bits Multiplier Shift...

    Multipliero = 1 Multipliero = 0 Multiplicand Shift Left 1. Test Multiplero 64 bits Multiplier Shift Right la. Add multiplicand to product and place the result in Product register 64-bit ALU 32 bits Product Write 64 bits Control Test 2. Shift the Multiplicand register left I bit 3. Shift the Multiplier register right I bit 324 Repetition Yes Done b) [20 Points] In class we discussed the implementation of the multiplication of 32- binary numbers. The above figure shows the...

  • implement the following hardware synchronously in verilog سخت افزار ضرب Start Multiplier0 = 1 Multipiero =...

    implement the following hardware synchronously in verilog سخت افزار ضرب Start Multiplier0 = 1 Multipiero = 0 1. Test Multipliero 1a. Add multiplicand to product and place the result in Product register 2 Shift the Multiplicand register left 1 bit 3. Shift the Multiplier register right 1 bit No: < 32 repetitions 32nd repetition? Multiplicand Shift left B4 bits Yes: 32 repetitions 64-bit ALU Done Nultiplier Shit right 32 bits Product Controltos! Write 64 bits

  • lis 2) ALU Design: Carry-Select Adder 31 Given: The following questions deal with two unsigned 6-bit...

    lis 2) ALU Design: Carry-Select Adder 31 Given: The following questions deal with two unsigned 6-bit numbers shown below in the hex format. A= 0x02 B=0x15 Suppose that the multiplier shown below is used to calculate the product of A (Multiplicand) and B (Multiplier) (Assume both values are unsigned). Consider using the "Add-and-Right-Shift Multiplier" design to compute A B. You may assume all registers are large enough to contain as many bits as are required. Sought: a) What are the...

  • Given: The following questions deal with two unsigned 6-bit numbers shown below in the hex format....

    Given: The following questions deal with two unsigned 6-bit numbers shown below in the hex format. A= 0x08 B=0x15 Suppose that the multiplier shown below is used to calculate the product of A (Multiplicand) and B (Multiplier) (Assume both values are unsigned). Consider using the "Add-and-Right-Shift Multiplier" design to compute A*B. You may assume all registers are large enough to contain as many bits as are required. Sought: a) What are the value in for the Multiplicand, Multiplier and Product...

  • Given: The following questions deal with two unsigned 6-bit numbers shown below in the hex format....

    Given: The following questions deal with two unsigned 6-bit numbers shown below in the hex format. A= 0x02 B=0x1F Suppose that the multiplier shown below is used to calculate the product of A (Multiplicand) and B (Multiplier) (Assume both values are unsigned). Consider using the "Add-and-Right-Shift Multiplier" design to compute A B. You may assume all registers are large enough to contain as many bits as are required. Sought: a) What are the value in for the Multiplicand, Multiplier and...

  • The Arithmetic Logic Unit The first topic for the project is to create an Arithmetic Logic...

    The Arithmetic Logic Unit The first topic for the project is to create an Arithmetic Logic Unit, using a structured approached with a Virtual Hardware Design Language such as Verilog. Mainly, the program is very close to a simulator for a programming calculator. An ALU typically has the following operations Math Functions: Add, Subtract, Multiply, Divide, Modulus Logic Functions: And, Or, XOR, Not, Nand, Nor, XNOR Error Modes: Divide by Zero, Overflow Support Functions: No Operation, Shift Left, Shift Right,...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
Active Questions
ADVERTISEMENT