From 2d007d9ced1375b33132253853f6a44830b8c2c8 Mon Sep 17 00:00:00 2001 From: lkcl Date: Tue, 19 Apr 2022 19:20:35 +0100 Subject: [PATCH] --- openpower/sv/biginteger.mdwn | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/openpower/sv/biginteger.mdwn b/openpower/sv/biginteger.mdwn index 18cd7b0cd..ac271714b 100644 --- a/openpower/sv/biginteger.mdwn +++ b/openpower/sv/biginteger.mdwn @@ -108,7 +108,7 @@ operations. Such a trick works equally as well in Scalar-only. The simplest implementation of big-int divide is the standard schoolbook "Long Division", set with RADIX 64 instead of Base 10. Donald Knuth's Algorithm D performs estimates which, if wrong, are compensated for -afterwards. Essentially however there are three phases: +afterwards. Essentiallythere are three phases: * Calculation of the quotient estimate. This is Scalar division and can be ignored for the scope of this analysis -- 2.30.2