This preview shows page 1. Sign up to view the full content.
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
This note was uploaded on 04/18/2010 for the course CS 151B taught by Professor N/a during the Spring '10 term at UCLA.
 Spring '10
 N/A

Click to edit the document details