Implement Booth\'s algorithm for multiplication of two signed 32-bit numbers tha

Question

Implement Booth's algorithm for multiplication of two signed 32-bit numbers that yield a 64 bit solution.

1) Set up in assembler to take in two 32-bit numbers (ints) via scanf and printf a 64-bit solution (long int). 2) To see the full effect of the bit operations, the core of the function must use 32 bit registers to implement booth's algorithm.

3) Deal with the first step where the next bit is assumed to be a 0. After that, loop 31 times repeating the same steps to form the 64-bit answer in two 32-bit registers. Lastly, take the two 32-bit registers holding the answer and move into a 64-reigster.

Explanation / Answer

/** ** Java Program to Implement Booth Algorithm **/ import java.util.Scanner; /** Class Booth **/ public class Booth { public static Scanner s = new Scanner(System.in); /** Function to multiply **/ public int multiply(int n1, int n2) { int[] m = binary(n1); int[] m1 = binary(-n1); int[] r = binary(n2); int[] A = new int[9]; int[] S = new int[9]; int[] P = new int[9]; for (int i = 0; i < 4; i++) { A[i] = m[i]; S[i] = m1[i]; P[i + 4] = r[i]; } display(A, 'A'); display(S, 'S'); display(P, 'P'); System.out.println(); for (int i = 0; i < 4; i++) { if (P[7] == 0 && P[8] == 0); // do nothing else if (P[7] == 1 && P[8] == 0) add(P, S); else if (P[7] == 0 && P[8] == 1) add(P, A); else if (P[7] == 1 && P[8] == 1); // do nothing rightShift(P); display(P, 'P'); } return getDecimal(P); } /** Function to get Decimal equivalent of P **/ public int getDecimal(int[] B) { int p = 0; int t = 1; for (int i = 7; i >= 0; i--, t *= 2) p += (B[i] * t); if (p > 64) p = -(256 - p); return p; } /** Function to right shift array **/ public void rightShift(int[] A) { for (int i = 8; i >= 1; i--) A[i] = A[i - 1]; } /** Function to add two binary arrays **/ public void add(int[] A, int[] B) { int carry = 0; for (int i = 8; i >= 0; i--) { int temp = A[i] + B[i] + carry; A[i] = temp % 2; carry = temp / 2; } } /** Function to get binary of a number **/ public int[] binary(int n) { int[] bin = new int[4]; int ctr = 3; int num = n; /** for negative numbers 2 complment **/ if (n < 0) num = 16 + n; while (num != 0) { bin[ctr--] = num % 2; num /= 2; } return bin; } /** Function to print array **/ public void display(int[] P, char ch) { System.out.print(" "+ ch +" : "); for (int i = 0; i

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.