What is the minimum ammount of bytes required to imlement 32-bit divider?
Answers
Answered by
0
The simplest divider circuit (in hardware cost) performs repeated subtraction, just like you learned to do in elementary school. It turns out that half of the register used to hold the partial remainder during each iteration can be shared with the quotient as it evolves. The size of the partial remainder gets one bit smaller in each round as the quotient gains one bit.
So to divide two 32 bit numbers, you need 101 bits of total storage: 32 for the divisor, and 64 for preloading the partial remainder with the dividend and padding it. At the end of the process the partial remainder’s upper 32 bits are the final remainder and the lower 32 bits hold the integer quotient. Lastly, you also need a 5 bit counter to keep track of how many subtractions have been performed.
So to divide two 32 bit numbers, you need 101 bits of total storage: 32 for the divisor, and 64 for preloading the partial remainder with the dividend and padding it. At the end of the process the partial remainder’s upper 32 bits are the final remainder and the lower 32 bits hold the integer quotient. Lastly, you also need a 5 bit counter to keep track of how many subtractions have been performed.
Similar questions