[12]The discussion of the remainder-step instruction assumed that division was done using a bit-at-a-time algorithm. What would have to change if division were implemented using a higher-radix method?...

division was done using a bit-at-a-time algorithm. What would have to change

if division were implemented using a higher-radix method?

A.[25]In the array of Figure J.28, the fact that an array can be pipelined is not

exploited. Can you come up with a design that feeds the output of the bottom CSA

into the bottom CSAs instead of the top one, and that will run faster than the

arrangement of Figure J.28