The Gateway to Computer Science Excellence
+1 vote
323 views
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." ?
in Digital Logic by Loyal (7k points) | 323 views
0

check this answer

one extra step is done whenever at LSB $10$ or $01$ is seen.

1 Answer

+1 vote

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...

by Active (2.3k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,385 answers
198,557 comments
105,369 users