From f3a70115c263909cd5854374162c3862979ede6d Mon Sep 17 00:00:00 2001 From: lkcl Date: Sun, 24 Apr 2022 08:19:25 +0100 Subject: [PATCH] --- openpower/sv/biginteger/analysis.mdwn | 3 +++ 1 file changed, 3 insertions(+) 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. -- 2.30.2