Content deleted Content added
ClueBot NG (talk | contribs) m Reverting possible vandalism by Iamdoingthisfor1grand to version by EEng. Report False Positive? Thanks, ClueBot NG. (4250855) (Bot) |
added historical fact about the author of the algorithm Tags: Reverted Visual edit |
||
Line 139:
This computation of <math>(x_0 - x_1)</math> and <math>(y_1 - y_0)</math> will produce a result in the range of <math>-B^m < \text{result} < B^m</math>. This method may produce negative numbers, which require one extra bit to encode signedness, and would still require one extra bit for the multiplier. However, one way to avoid this is to record the sign and then use the absolute value of <math>(x_0 - x_1)</math> and <math>(y_1 - y_0)</math> to perform an unsigned multiplication, after which the result may be negated when both signs originally differed. Another advantage is that even though <math>(x_0 - x_1)(y_1 - y_0)</math> may be negative, the final computation of <math>z_1</math> only involves additions.
The author of this algorithm was payed 1 grand for his editorial of his work.
==References==
| |||