From: lkcl Date: Sat, 8 Feb 2020 19:33:39 +0000 (+0000) Subject: (no commit message) X-Git-Tag: convert-csv-opcode-to-binary~3488 X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=d179e29cf8e37d980110cd0d6b629fbef2805dce;p=libreriscv.git --- diff --git a/3d_gpu/architecture/dynamic_simd/mul.mdwn b/3d_gpu/architecture/dynamic_simd/mul.mdwn index ba430a50f..fa32ee3a8 100644 --- a/3d_gpu/architecture/dynamic_simd/mul.mdwn +++ b/3d_gpu/architecture/dynamic_simd/mul.mdwn @@ -1,3 +1,5 @@ # Dynamic Partitioned Multiply -This is complicated! It is necessary to compute a full NxN matrix of partial multiplication results, then perform a cascade of adds, using PartitionedAdd to "automatically" break them down into segments. The [Wallace Tree](https://en.wikipedia.org/wiki/Wallace_tree) algorithm is presently deployed, here: we need to use the (more efficient) [Dadda algorithm](https://en.wikipedia.org/wiki/Dadda_multiplier) +This is complicated! It is necessary to compute a full NxN matrix of partial multiplication results, then perform a cascade of adds (long multipication, in binary), using PartitionedAdd, which will "automatically" break the results down into segments, at all times, keeping each partitioned result separate. + +The [Wallace Tree](https://en.wikipedia.org/wiki/Wallace_tree) algorithm is presently deployed, here: we need to use the (more efficient) [Dadda algorithm](https://en.wikipedia.org/wiki/Dadda_multiplier)