1,630 views
1 votes
1 votes
Can anybody Explain why is it so that

"The worst case of an implementation using Booth’s algorithm is when pairs of 01s or 10s occur very frequently in the multiplier." ?

1 Answer

1 votes
1 votes

Booth's Multiplication Algorithm reduces the number of additions and substractions done during the multiplication.

The number of additions done is equals to the number of times +1 occurs in Booth recoded multiplier and number of substraction is equals to number of times -1 occurs in it. So the worst case occurs when pairs of 01s or 10s occur very frequently in the multiplier, as it increases the number of +1 and -1 in the multiplier...

Related questions

0 votes
0 votes
0 answers
1
Tuhin Dutta asked Nov 26, 2017
1,357 views
Let's say we have a multiplier $ (10101010)_2 $. Then applying booth re-coding,Method 1:appending a zero at the end: $ (1\ 0\ 1\ 0\ 1\ 0\ 1\ 0\ 0)_2 = (-1\ 1\ -1\ 1\ -1\...
0 votes
0 votes
0 answers
3
0 votes
0 votes
0 answers
4
Magma asked Jan 15, 2019
1,676 views
Consider the following 8 bit multiplication process (-121) X (-113) . What is the recorded multiplier in the multiplication.