1 1 vote 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." ? Digital Logic booths-algorithm digital-logic + – Na462 2.5k views answer comment Share Follow Print See 1 comment 1 1 comment reply Mk Utkarsh commented Oct 4, 2018 reply Follow flag check this answer one extra step is done whenever at LSB $10$ or $01$ is seen. 0 0 replyShare Please log in or register to add a comment.
1 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... Nirmal Gaur answered Apr 17, 2018 Nirmal Gaur comment Share Follow 0 reply Please log in or register to add a comment.
