From: lkcl Date: Sun, 17 Jan 2021 01:32:40 +0000 (+0000) Subject: (no commit message) X-Git-Tag: convert-csv-opcode-to-binary~437 X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=60356f191fc70c541637ef090988c71942c947e3;p=libreriscv.git --- diff --git a/3d_gpu/architecture/dynamic_simd/mul.mdwn b/3d_gpu/architecture/dynamic_simd/mul.mdwn index b350aac64..7a678086a 100644 --- a/3d_gpu/architecture/dynamic_simd/mul.mdwn +++ b/3d_gpu/architecture/dynamic_simd/mul.mdwn @@ -6,6 +6,6 @@ This is complicated! It is necessary to compute a full NxN matrix of partial mu Therefore, for a full 64 bit multiply, with 7 partitions, a matrix of 8x8 multiplications are performed, then added up in each column of the same magnitude, in exactly the same way as described by Vedic Mathematics, - + 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)