From 876fd92d8fe8b32e1d73f4e26a3665842cf712f8 Mon Sep 17 00:00:00 2001 From: lkcl Date: Mon, 2 May 2022 00:39:40 +0100 Subject: [PATCH] --- openpower/sv/biginteger/analysis.mdwn | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/openpower/sv/biginteger/analysis.mdwn b/openpower/sv/biginteger/analysis.mdwn index 2523bf377..c2c2956ec 100644 --- a/openpower/sv/biginteger/analysis.mdwn +++ b/openpower/sv/biginteger/analysis.mdwn @@ -534,7 +534,7 @@ is preserved, as long as RC starts at zero. One of the worst things for any ISA is that an algorithm's completion time is directly affected by different implementations having instructions take longer or shorter times. Knuth's Big-Integer division is unfortunately -one such algorithm, where Big-Integer Goldschmidt divide is not. +one such algorithm. Assuming that the computation of qhat takes 128 cycles to complete on a small power-efficient embedded design, this time would dominate -- 2.30.2