Content deleted Content added
added historical fact about the author of the algorithm Tags: Reverted Visual edit |
Reverting edit(s) by 2605:A601:AA92:3800:94EA:49D9:5F2B:C10B (talk) to rev. 1161947574 by ClueBot NG: needs citation, may not be due mention (and if so should be better incorporated into existing prose) (UV 0.1.4) |
||
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.
==References==
| |||