(no commit message)

diff --git a/openpower/sv/biginteger/analysis.mdwn b/openpower/sv/biginteger/analysis.mdwn
index bcaa0cd26c5d9344bde7aa76a06e34f016e4017c..567975d5ac610f9e5daa99de746eb0f8ede5a1e4 100644 (file)
--- 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.