Nonrestoring division for unsigned binary

Question

I have tried to look online for a way to do a non-restoring division, but the explanation has still left me quite clueless.

dividend = 0100 0011 1100 0000

quotient = 0110 0010

divisor is not given

How do you figure out the total # of operations (ie. the number of subtractions, the number of additions performed)?

Answer 1

Which algorithm are you using? When I think about division I think about boothes algorithm, but that is in hardware.

I would suggest that you write out an approach.

Then, write it out in pseudo-code.

Then you can look at operations involved.

Once you have that, if you share that on SO you will get more help with your homework, as you have tried and gotten stuck.

Answer 2

I would suggest you refer Cyclic Redundancy Check (CRC). It may give you some hint.