Scribd
Upload
159 views6 pages

Implementation of Booth's Algorithm

The document implements Booth's algorithm for multiplying binary numbers using C++. It defines functions for adding arrays representing binary numbers, complementing a number, right shifting, and displaying results. The main function sets up the multiplier, multiplicand, and quotient registers and calls the boothAlgorithm function, which iteratively adds or subtracts the multiplier based on the most significant bits and shifts the registers to compute the product.

Uploaded by

Pournami Pottekat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
159 views6 pages

Implementation of Booth's Algorithm

The document implements Booth's algorithm for multiplying binary numbers using C++. It defines functions for adding arrays representing binary numbers, complementing a number, right shifting, and displaying results. The main function sets up the multiplier, multiplicand, and quotient registers and calls the boothAlgorithm function, which iteratively adds or subtracts the multiplier based on the most significant bits and shifts the registers to compute the product.

Uploaded by

Pournami Pottekat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Aim: To implement Booth’s algorithm.

Code:
#include <bits/stdc++.h>
using namespace std;

void add(int ac[], int x[], int qrn)


{
int i, c = 0;
for (i = 0; i < qrn; i++) {

ac[i] = ac[i] + x[i] + c;


if (ac[i] > 1) {
ac[i] = ac[i] % 2;
c = 1;
}
else
c = 0;
}
}

void complement(int a[], int n)


{
int i;
int x[8] = { 0};
x[0] = 1;
for (i = 0; i < n; i++) {
a[i] = (a[i] + 1) % 2;
}
add(a, x, n);
}

void rightShift(int ac[], int qr[], int& qn, int qrn)


{
int temp, i;
temp = ac[0];
qn = qr[0];
cout << "\t\trightShift\t";
for (i = 0; i < qrn - 1; i++) {
ac[i] = ac[i + 1];
qr[i] = qr[i + 1];
}
qr[qrn - 1] = temp;
}

void display(int ac[], int qr[], int qrn)


{
int i;

for (i = qrn - 1; i >= 0; i--)


cout << ac[i];
cout << "\t";

for (i = qrn - 1; i >= 0; i--)


cout << qr[i];
}

void boothAlgorithm(int br[], int qr[], int mt[], int qrn, int sc)
{
int qn = 0, ac[10] = { 0 };
int temp = 0;
cout << "qn\tq[n+1]\t\tBR\t\tAC\tQR\t\tsc\n";
cout << "\t\t\tinitial\t\t";
display(ac, qr, qrn);
cout << "\t\t" << sc << "\n";
while (sc != 0) {
cout << qr[0] << "\t" << qn;

if ((qn + qr[0]) == 1)
{
if (temp == 0) {

add(ac, mt, qrn);


cout << "\t\tA = A - BR\t";
for (int i = qrn - 1; i >= 0; i--)
cout << ac[i];
temp = 1;
}

else if (temp == 1)
{
add(ac, br, qrn);
cout << "\t\tA = A + BR\t";
for (int i = qrn - 1; i >= 0; i--)
cout << ac[i];
temp = 0;
}
cout << "\n\t";
rightShift(ac, qr, qn, qrn);
}

else if (qn - qr[0] == 0)


rightShift(ac, qr, qn, qrn);
display(ac, qr, qrn);
cout << "\t";

sc--;
cout << "\t" << sc << "\n";
}
}

int main(int argc, char** arg)


{
int mt[10], sc;
int brn, qrn;

brn = 4;
int br[] = { 0, 1, 1, 0 };

for (int i = brn - 1; i >= 0; i--)


mt[i] = br[i];
reverse(br, br + brn);
complement(mt, brn);

qrn = 4;

sc = qrn;

int qr[] = { 0, 0, 1, 0 };
reverse(qr, qr + qrn);
boothAlgorithm(br, qr, mt, qrn, sc);
cout << endl
<< "Result = ";
for (int i = qrn - 1; i >= 0; i--)
cout << qr[i];
}
Output:
Conclusion: From this experiment we implemented booth’s algorithm using C+
+ programming language.

You might also like