From: lkcl <lkcl@web>
Date: Sun, 17 Jan 2021 01:32:55 +0000 (+0000)
Subject: (no commit message)
X-Git-Tag: convert-csv-opcode-to-binary~436
X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=1d5a08c8a572b421fe8e478f219e4e3504e51777;p=libreriscv.git

---

diff --git a/3d_gpu/architecture/dynamic_simd/mul.mdwn b/3d_gpu/architecture/dynamic_simd/mul.mdwn
index 7a678086a..bf7f371df 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,
 
-<img src="https://img.fireden.net/sci/image/1483/07/1483079339205.png" width="600px" />
+<img src="https://img.fireden.net/sci/image/1483/07/1483079339205.png" width="400px" />
 
 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)