Unformatted text preview: done on slide 10 of lecture 5. Problem 3. In the worst case, Booth's algorithm can actually perform more operations (adds and shifts) than the multiply algorithm of slide 3 of lecture 5. What is that worst case? Problem 4. To avoid the worst case in problem 3, we will try a new version of Booth's algorithm  one that looks at three bits of the multiplier at a time rather than just two. Can you formulate a table like the one in slide 9 that handles a three bit Booth's algorithm? HINT  consider the current bit, the bit to the right, and then the bit to the right of that....
View
Full Document
 Spring '10
 N/A
 Addition, Multiplication, worst case, Carrysave adder

Click to edit the document details