Skip to main content
10 events
when toggle format what by license comment
Feb 9, 2019 at 14:43 comment added Peter Smith Compare, Subtract and shift is a division algorithm related to the add and shift multiplication algorithm. I implemented this on a lot of early micros and it has the advantage that the time taken is data independent.
S Feb 9, 2019 at 8:42 history suggested Dexter Jackson CC BY-SA 4.0
fixed grammar, spelling, and some word choice to give a clearer message
Feb 9, 2019 at 1:56 review Suggested edits
S Feb 9, 2019 at 8:42
Sep 21, 2018 at 5:48 comment added Weishi Z How is division of negative number implemented? E.g. -3 / 7. Does it directly operate on the 2's complement representation, or it take the signed bit out during division?
Aug 29, 2017 at 4:05 comment added CogitoErgoCogitoSum How do you "multiply by a fraction"? Fractions are not representable in floating point. A fraction by definition is numerator divided by denominator, so you are left in a circular argument of still having to divide. And how does one estimate that fraction in the first place?
Feb 24, 2015 at 6:36 comment added Alan Campbell @program-o-steve Here is a quick illustration: find 22/7 (pi approximation). First, multiply top and bottom by 0.1 to get: 2.2/0.7 Multiply again, using 1.3, giving: 2.86/0.91 Using 1.09 gives: 3.1174/0.9919 1.008 gives: 3.1423393/0.9998352 Keep going, you'll soon reach FINAL ANSWER 3.1428571/1.000000...
Nov 19, 2011 at 5:57 comment added program-o-steve what is that method in which we have to repeatedly shift the dividend to left ?
Nov 19, 2011 at 3:38 comment added program-o-steve can you please give an illustration on Goldschmidt method of division. Also the flow chart given here is an example of slow division ?
Nov 18, 2011 at 19:57 comment added Kevin Vermeer Some flowcharts for variations on the 'slow' method (implemented in assembly on micros without hardware divide, but still helpful) are given in Atmel's AVR200 appnote.
Nov 18, 2011 at 19:25 history answered Konsalik CC BY-SA 3.0