From: lkcl <lkcl@web>
Date: Tue, 19 Apr 2022 17:23:03 +0000 (+0100)
Subject: (no commit message)
X-Git-Tag: opf_rfc_ls005_v1~2693
X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=e091d6cd5bb48372bdc5982e71952abafe43613b;p=libreriscv.git

---

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