Question

In: Computer Science

Using a 5-bit version of booth algorithm, multiple 13 and -2. Verify your answer. please show...

Using a 5-bit version of booth algorithm, multiple 13 and -2. Verify your answer. please show all your steps

Solutions

Expert Solution

Ans:

Multiplicand:

-2 in binary: 11110

=> 2in binary: 00010 (so we can add this when we need to perform subtract action with the multiplicand)

Multiplier:

13 in binary: 01101

Expected Result: = -26 in binary: 11111 00110

A Q Q-1 M Action
00000 01101 0 11110 Initial values
00010
00001
01101
00110
0
1
11110
10: Substraction
Right shift above value
11111
11111
00110
10011
1
0
11110
01: Sum
Right shift above value
00001
00000
10011
11001
0
1
11110
10: Substraction
Right shift above value
00000
00000
11001
01100
1
1
11110
11: Without sum or substraction
Right shift above value
11110
11111
01100
00110
1
0
11110
01: Sum
Right shift above value


Hence, final value = 11111 00110 = -26

venereology answered 2 years ago
Next > < Previous

Related Solutions

Write a verilog code for 8-bit signed multiplication using Booth algorithm and represent the RTL view...
Write a verilog code for 8-bit signed multiplication using Booth algorithm and represent the RTL view for code
Try designing a 4 bit Multiplexer using two 2-bit multiplexer design given below and verify the...
Try designing a 4 bit Multiplexer using two 2-bit multiplexer design given below and verify the design by simulating it. module Mux2x1(In0,In1,sel,out); input In0,In1,sel; output out; assign out = (sel)?In1:In0; endmodule Pls include the verilog design module,testbench, waveform
Using Multisim, design a 2-bit, synchronous binary counter and verify that it counts in the right...
Using Multisim, design a 2-bit, synchronous binary counter and verify that it counts in the right sequence, Can count up or down and use any FF you desire; 4 screen shots in total: 1 for each input combination
a. Using the Euclidean Algorithm and Extended Euclidean Algorithm, show that gcd(99; 5) = 1 and...
a. Using the Euclidean Algorithm and Extended Euclidean Algorithm, show that gcd(99; 5) = 1 and find integers s1 and t1 such that 5s1 + 99t1 = 1. [Hint: You should find that 5(20) + 99(?1) = 1] b. Solve the congruence 5x 17 (mod 99) c. Using the Chinese Remainder Theorem, solve the congruence x 3 (mod 5) x 42 (mod 99) d. Using the Chinese Remainder Theorem, solve the congruence x 3 (mod 5) x 6 (mod 9)...
write a C/C++ program that implements the banker's algorithm. Verify your implementation using the data from...
write a C/C++ program that implements the banker's algorithm. Verify your implementation using the data from the textbook as well as the attached, but unverified (meaning that it is possible the system is already in an unsafe state), file. The file format is as follows: Line 1 contains a number of resources (m). Line 2 contains the quantity for each resource (I.e., the resource vector. Line 3 contains the number of processes (n). Lines 4 through 3+n contain the Claim...
Use principles of physics to solve the problem and then verify your answer using the simulation....
Use principles of physics to solve the problem and then verify your answer using the simulation. Assume that the acceleration due to gravity has a magnitude of g = 9.80 m/s2. If the range of the projectile is 5.96 m, the time-of-flight is T = 1.20 s, and air resistance is turned off, determine the following. A. What is the launch angle of the projectile? B. What is the initial speed of the projectile? C. Express the maximum height reached...
Please show all work and calculations neatly! no code allowed! --------------- Using Simpson's Rule, verify that...
Please show all work and calculations neatly! no code allowed! --------------- Using Simpson's Rule, verify that the weight w1 equals 4h/3 by integrating the appropriate Lagrange basis function
add the following numbers using 16-bit 2's complement. show all the steps and calculations. Please also...
add the following numbers using 16-bit 2's complement. show all the steps and calculations. Please also show steps to verify that the answer is correct. -7493 and -6372
PLEASE ANSWER USING C# Is there a Prius version? Did you know that the average Boeing...
PLEASE ANSWER USING C# Is there a Prius version? Did you know that the average Boeing 747 airplane uses approximately 1 gallon of fuel per second? Given the speed of the airplane, that means it gets 5 gallons to the mile. No, not 5 miles to the gallon, 5 gallons to the mile. You may be questioning why such a horribly inefficient machine is allowed to exist, but you’ll be happy to find out that, because this airplane hold 568...
Please show all work: Represent the number (+46.5) as a 32 bit floating-point number using the...
Please show all work: Represent the number (+46.5) as a 32 bit floating-point number using the IEEE standard 754 format. N.B. The attached ‘Appendix’ section may prove useful in the conversion process.             0 1000 0111 0100 0100 0000 0000 0000 000 0 1011 0100 0111 0100 0000 0000 0000 000 0 1100 0110 0101 0100 0000 0000 0000 000 0 1000 0100 0111 0100 0000 0000 0000 000 0 1010 0100 0111 0100 0000 0000 0000 000
ADVERTISEMENT
Subjects
ADVERTISEMENT
Latest Questions
ADVERTISEMENT