(no commit message)

diff --git a/openpower/sv/biginteger/analysis.mdwn b/openpower/sv/biginteger/analysis.mdwn
index 7eef6c1251788f347b9228bced0a40a7e91a9c74..3d8bdbe058b1c82a2cf9eac6dee4a7fc3412ee7f 100644 (file)
--- 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