edited by
7,498 views
24 votes
24 votes

Booth’s algorithm for integer multiplication gives worst performance when the multiplier pattern is

  1. $101010\ldots1010$

  2. $100000\ldots 0001$

  3. $111111\ldots 1111$

  4. $011111\ldots1110$

edited by

2 Answers

Best answer
33 votes
33 votes
Answer: A

The worst case of an implementation using Booth’s algorithm is when pairs of $01$s or $10$s occur very frequently in the multiplier.
edited by
11 votes
11 votes

$\text{Booth Multiplication}:$ Booth multiplication is used to reduce the number of additions. Peformance of Booth Algorithm depends on number of Additions and Subtractions.

$\text{Booth Recoding}:$ 

Operand $X_i$ Operand $X_{i-1}$ Recoded Version $Y_i$
$0$ $0$ $0$
$0$ $1$ $1$
$1$ $0$ $-1$
$1$ $1$ $0$

 

So Option $A$ 

edited by
Answer:

Related questions

33 votes
33 votes
2 answers
2
Kathleen asked Oct 9, 2014
18,549 views
A ROM is used to store the table for multiplication of two $8$-bit unsigned integers. The size of ROM required is$256 \times 16$$64 K \times 8$$4 K \times 16$$64 K \times...
40 votes
40 votes
5 answers
3
Kathleen asked Oct 9, 2014
12,800 views
Consider the following state table for a sequential machine. The number of states in the minimized machine will be$$\begin{array}{|l|l|ll|}\hline \text{} & \text{} & \tex...
6 votes
6 votes
1 answer
4
go_editor asked Feb 10, 2018
2,341 views
Consider the synchronous sequential circuit in the below figureGiven that the initial state of the circuit is $S_4,$ identify the set of states, which are not reachable.