3 votes 3 votes Booth’s Algorithm for integer multiplication gives best performance when the multiplier pattern is 01110111 10101010 00100011 CO and Architecture booths-algorithm co-and-architecture + – Parshu gate asked Nov 16, 2017 Parshu gate 6.2k views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Anu007 commented Nov 16, 2017 reply Follow Share 01110111 give same as 3 10101010 gives worst 00100011 give same as 1 0 votes 0 votes Parshu gate commented Nov 16, 2017 reply Follow Share How did u calculate? 0 votes 0 votes Manu Thakur commented Nov 16, 2017 reply Follow Share the one which contains less number of 01 or 10 will perform better. hence 3 will give worst performance. because when 00 or 11 pairs are encountered, no addition/subtraction will be performed. but when 01 occurs one add operation and when 10 occurs one subtraction will be performed. Both 1 and 3 will require 4 arithmetic operations. 0 votes 0 votes joshi_nitish commented Nov 19, 2017 reply Follow Share when # of arthemetic operations are equal then performance will depend on shift operations, 1st has 14 shift operations, wheras 3rd has 13 shift operations, therfore 3rd is somewhat faster than 1st 2 votes 2 votes Please log in or register to add a comment.
Best answer 5 votes 5 votes .... Hira Thakur answered Nov 17, 2017 • selected Nov 17, 2017 by Parshu gate Hira Thakur comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments Anu007 commented Jan 11, 2018 reply Follow Share you mean for 0 no ASR performed ryt? http://www.studytonight.com/computer-architecture/booth-multiplication-algorithm https://courses.cs.washington.edu/courses/cse378/00sp/Sec5-1.htm both link saying ASR is perfomed for 00,10,11 and 01 0 votes 0 votes Jason commented Apr 9, 2018 reply Follow Share @Hira Thakur please provide reference to no of shift operations. As per given in Wikipedia, we have to perform shift operations on every occurence of $00,01,10,11$. 2 votes 2 votes Sai Shravan commented Jan 30, 2019 reply Follow Share The booth coding seems to be wrong . since on booth coding to decimal conversion( multiplying with 2^n) I am getting (-1)*128+(0)*64+(+1)*32+(0)*16+(-1)*8+(+1)*4+(-1)*2+(0)*1= -102 I think this is due to not including the sign bit for booth coding ,when we use that,the booth code becomes +1-10+10-1+1-10 which on decimal conversion gives 154.Then total shift operations = 26 Please correct me if I am wrong. 0 votes 0 votes Please log in or register to add a comment.