From: lkcl <lkcl@web>
Date: Sun, 1 May 2022 23:39:40 +0000 (+0100)
Subject: (no commit message)
X-Git-Tag: opf_rfc_ls005_v1~2523
X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=876fd92d8fe8b32e1d73f4e26a3665842cf712f8;p=libreriscv.git

---

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