From: lkcl <lkcl@web>
Date: Sat, 23 Jul 2022 15:04:35 +0000 (+0100)
Subject: (no commit message)
X-Git-Tag: opf_rfc_ls005_v1~1067
X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=3bb9548bf2f8f1f748acef4863a67a367517bbc0;p=libreriscv.git

---

diff --git a/openpower/sv/biginteger/analysis.mdwn b/openpower/sv/biginteger/analysis.mdwn
index 7eef6c125..3d8bdbe05 100644
--- a/openpower/sv/biginteger/analysis.mdwn
+++ b/openpower/sv/biginteger/analysis.mdwn
@@ -28,7 +28,9 @@ 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.
+*This fits naturally with a Scalable Vector ISA such as SVP64*.
+It only remains to exploit Carry (1-bit and 64-bit) in a Scalable Vector
+context and the picture is complete.
 
 Links