From: lkcl <lkcl@web>
Date: Thu, 28 Apr 2022 11:15:43 +0000 (+0100)
Subject: (no commit message)
X-Git-Tag: opf_rfc_ls005_v1~2550
X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=1b25327b73ebde5ce2211c9e6b7add944e292535;p=libreriscv.git

---

diff --git a/openpower/sv/biginteger/analysis.mdwn b/openpower/sv/biginteger/analysis.mdwn
index 815dd0e89..a435b12f4 100644
--- a/openpower/sv/biginteger/analysis.mdwn
+++ b/openpower/sv/biginteger/analysis.mdwn
@@ -23,6 +23,10 @@ O(1) and O(N).  Knuth's big-integer scalar algorithms provide
 useful real-world grounding into the types of operations needed,
 making it easy to demonstrate how they would be Vectorised.
 
+The basic principle behind Knuth's algorithms is to break the
+problem down into a single scalar op against a Vector operand.
+This fits extremely well with SVP64.
+
 Links
 
 * <http://www.intel.com/content/dam/www/public/us/en/documents/white-papers/ia-large-integer-arithmetic-paper.pdf>