From: lkcl <lkcl@web>
Date: Sun, 24 Apr 2022 07:19:25 +0000 (+0100)
Subject: (no commit message)
X-Git-Tag: opf_rfc_ls005_v1~2608
X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=f3a70115c263909cd5854374162c3862979ede6d;p=libreriscv.git

---

diff --git a/openpower/sv/biginteger/analysis.mdwn b/openpower/sv/biginteger/analysis.mdwn
index bcaa0cd26..567975d5a 100644
--- a/openpower/sv/biginteger/analysis.mdwn
+++ b/openpower/sv/biginteger/analysis.mdwn
@@ -365,3 +365,6 @@ divide would be a whopping 128 cycles.  To be workable an alternative
 algorithm is required, and one of the fastest appears to be
 Goldschmidt Division.  Whilst typically deployed for Floating Point,
 there is no reason why it should not be adapted to Fixed Point.
+In this way a Scalar Integer divide can be performed in the same
+time-order as Newton-Raphson, using two hardware multipliers
+and a subtract.