From: lkcl <lkcl@web>
Date: Thu, 21 Apr 2022 17:59:50 +0000 (+0100)
Subject: (no commit message)
X-Git-Tag: opf_rfc_ls005_v1~2634
X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=355aad7912d525fc9eb7657e03ea0d5d48f8ab7c;p=libreriscv.git

---

diff --git a/openpower/sv/biginteger/analysis.mdwn b/openpower/sv/biginteger/analysis.mdwn
index f44212fff..a9a913691 100644
--- a/openpower/sv/biginteger/analysis.mdwn
+++ b/openpower/sv/biginteger/analysis.mdwn
@@ -246,8 +246,9 @@ The simplest implementation of big-int divide is the standard schoolbook
 Algorithm D performs estimates which, if wrong, are compensated for
 afterwards.  Essentially there are three phases:
 
-* Calculation of the quotient estimate. This is Scalar division
-  and can be ignored for the scope of this analysis
+* Calculation of the quotient estimate. This uses a single
+  Scalar divide,
+  which can be ignored for the scope of this analysis
 * Big Integer multiply and subtract.
 * Carry-Correction with a big integer add, if the estimate from
   phase 1 was wrong by one digit.