From 2be1be661ce03894e2b595459deef4e6ba8fda5f Mon Sep 17 00:00:00 2001 From: lkcl Date: Thu, 21 Apr 2022 18:52:51 +0100 Subject: [PATCH] --- openpower/sv/biginteger/analysis.mdwn | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/openpower/sv/biginteger/analysis.mdwn b/openpower/sv/biginteger/analysis.mdwn index d19fffe6f..85759aecd 100644 --- 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, -- 2.30.2