Scribd
Upload
8 views3 pages

Booth

Uploaded by

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

Booth

Uploaded by

Ojesh Mundale
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Booth’s Multiplication Algorithm Code:

#include <stdio.h>
#include <math.h>
int a = 0, b = 0, c = 0, a1 = 0, b1 = 0, com[5] = {1, 0, 0, 0, 0};
int anum[5] = {0}, anumcp[5] = {0}, bnum[5] = {0}, bcomp[5] = {0}, pro[5] =
{0}, res[5] = {0};

void binary() {
a1 = fabs(a); b1 = fabs(b); int r, r2, i;
for (i = 0; i < 5; i++) {
r = a1 % 2; a1 /= 2; r2 = b1 % 2; b1 /= 2;
anum[i] = r; anumcp[i] = r; bnum[i] = r2; bcomp[i] = r2 ? 0 : 1;
}
c = 0; // two's complement for b
for (i = 0; i < 5; i++) {
res[i] = com[i] + bcomp[i] + c;
c = res[i] >= 2 ? 1 : 0;
res[i] %= 2;
}
for (i = 4; i >= 0; i--) bcomp[i] = res[i];

if (a < 0) {
c = 0;
for (i = 0; i < 5; i++) res[i] = com[i] + !anum[i] + c, c = res[i] >= 2 ? 1 : 0,
res[i] %= 2;
for (i = 4; i >= 0; i--) anum[i] = anumcp[i] = res[i];
}

if (b < 0) for (i = 0; i < 5; i++) { int temp = bnum[i]; bnum[i] = bcomp[i];


bcomp[i] = temp; }
}

void add(int num[]) {


int i;
c = 0;
for (i = 0; i < 5; i++) res[i] = pro[i] + num[i] + c, c = res[i] >= 2 ? 1 : 0,
res[i] %= 2;
for (i = 4; i >= 0; i--) pro[i] = res[i];
for (i = 4; i >= 0; i--) printf("%d", pro[i]);
printf(":");
for (i = 4; i >= 0; i--) printf("%d", anumcp[i]);
}

void arshift() {
int temp = pro[4], temp2 = pro[0], i;
for (i = 1; i < 5; i++) pro[i - 1] = pro[i], anumcp[i - 1] = anumcp[i];
pro[4] = temp; anumcp[4] = temp2;
printf("\nAR-SHIFT: ");
for (i = 4; i >= 0; i--) printf("%d", pro[i]);
printf(":");
for (i = 4; i >= 0; i--) printf("%d", anumcp[i]);
}
int main() {
int i, q = 0;
printf("\tBOOTH'S MULTIPLICATION ALGORITHM\nEnter A and B (<16):
");
do { scanf("%d %d", &a, &b); } while (a >= 16 || b >= 16);

printf("Expected product = %d\n", a * b);


binary();
printf("\nBinary A = "); for (i = 4; i >= 0; i--) printf("%d", anum[i]);
printf("\nBinary B = "); for (i = 4; i >= 0; i--) printf("%d", bnum[i]);
printf("\nB' + 1 = "); for (i = 4; i >= 0; i--) printf("%d", bcomp[i]);
printf("\n");

for (i = 0; i < 5; i++) {


printf("\n-->");
if (anum[i] == q) { arshift(); q = anum[i]; }
else if (anum[i] == 1 && q == 0) { printf("\nSUB B: "); add(bcomp);
arshift(); q = anum[i]; }
else { printf("\nADD B: "); add(bnum); arshift(); q = anum[i]; }
}
printf("\nProduct = ");
for (i = 4; i >= 0; i--) printf("%d", pro[i]);
for (i = 4; i >= 0; i--) printf("%d", anumcp[i]);
return 0;
}

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy