24 votes 24 votes Booth’s algorithm for integer multiplication gives worst performance when the multiplier pattern is $101010\ldots1010$ $100000\ldots 0001$ $111111\ldots 1111$ $011111\ldots1110$ Digital Logic gate1996 digital-logic booths-algorithm normal + – Kathleen asked Oct 9, 2014 edited Apr 30, 2021 by Lakshman Bhaiya Kathleen 7.5k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply akash commented Jan 25, 2015 reply Follow Share @Arjun sir,,can you explain option A and B?i m little confused 0 votes 0 votes smsubham commented Jan 5, 2018 reply Follow Share Best case is only 0's or 1's. 0 votes 0 votes Please log in or register to add a comment.
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. Rajarshi Sarkar answered Jun 4, 2015 edited Oct 28, 2018 by kenzou Rajarshi Sarkar comment Share Follow See all 2 Comments See all 2 2 Comments reply thor commented Dec 16, 2016 reply Follow Share Booth's algo is used for multiplication of two signed numbers, then what does above question actually mean? 0 votes 0 votes akash.dinkar12 commented Oct 30, 2017 i edited by akash.dinkar12 Jan 10, 2018 reply Follow Share Booth multiplication can be used for both signed and unsigned... 2 votes 2 votes Please log in or register to add a comment.
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$ Rishi yadav answered Apr 9, 2019 edited May 8, 2019 by Rishi yadav Rishi yadav comment Share Follow See all 0 reply Please log in or register to add a comment.