Recent content by Tosi

Thanks to all of you, now i understand the method completely :D .

Well, I've started with a dividend with twice as many bits as the divisor and this is what i get: http://prntscr.com/8bnxx The remainder is way off again :/ Someone knows what should i do differently?

I have another question with this method since i can't find any examples.. In the case where the divisor is bigger than the dividend and bigger than four bits. How many bits(zeros) should i write on the left of the remainder at the beginning(the part of the remainder where i do the subtracting...

Oh, i didn't notice XD . But when i was reading that for some reason, in my head I pictured the divisor instead of the dividend XD Don't worry I understood what you meant, thanks again :) .

Thanks a lot man :D, this was driving me crazy :)

Well the quotient is correct, but the remainder i get is 0111 which is 7.. :/

Well I've based the procedure on this example: http://www.cs.pitt.edu/~musfiq/teaching/cs0447/labs/lab07/CS447DivisionExamples.pdf. Based on this and some algorithms that I've seen, as i understood (please correct if I'm wrong, help is highly appreciated) the first step is shifting the...

I'm trying to divide 1011001 / 10 using the non-restoring division method. This is what i get: http://prntscr.com/8aecs . The remainder is not correct(it should be 0001 and I'm getting a 0111) and I'm wondering where is the mistake.. I've checked about 10 times and i don't see the problem. Can...