(no commit message)

diff --git a/openpower/sv/biginteger/analysis.mdwn b/openpower/sv/biginteger/analysis.mdwn
index e380386723b7b740d560cf01a9fd465fe525b2b9..f745748c7d904f2adae3c0a5d037d9ecae9316d2 100644 (file)
--- a/openpower/sv/biginteger/analysis.mdwn
+++ b/openpower/sv/biginteger/analysis.mdwn
@@ -8,14 +8,19 @@
 * Revision 0.03: 24apr2022 add 128/64 divrem2du, similar loop to madded
 * Revision 0.04: 26apr2022 Knuth original uses overflow on scalar div
 
+**Introduction**
+
 This page covers an analysis of big integer operations, to
 work out optimal Scalar Instructions to propose be submitted to
 the OpenPOWER ISA WG, that when combined with Draft SVP64 give
 high performance compact Big Integer Vector Arithmetic.
+
 Use of smaller sub-operations is a given: worst-case in a Scalar
 context, addition is O(N) whilst multiply and divide are O(N^2),
 and their Vectorisation would reduce those (for small N) to
-O(1) and O(N).
+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.
 
 Links