(no commit message)

diff --git a/openpower/sv/biginteger/analysis.mdwn b/openpower/sv/biginteger/analysis.mdwn
index d19fffe6f4cb0547445b26896de37680a4fed5b7..85759aecddc20b3e84758f1c71c1b40f5981d149 100644 (file)
--- a/openpower/sv/biginteger/analysis.mdwn
+++ b/openpower/sv/biginteger/analysis.mdwn
@@ -96,7 +96,8 @@ reduces the number of small multiplies at the expense of increasing
 the number of additions.  Some algorithms follow the Vedic Multiply
 pattern by grouping together all multiplies of the same magnitude/power
 (same column) whilst others perform row-based multiplication: a single
-digit of B multiplies the entirety of A, summed a row at a time. This
+digit of B multiplies the entirety of A, summed a row at a time.
+A Row-based
 algorithm is the basis of the analysis below (Knuth's Algorithm M).
 
 Multiply is tricky: 64 bit operands actually produce a 128-bit result,