(no commit message)

diff --git a/3d_gpu/architecture/dynamic_simd/mul.mdwn b/3d_gpu/architecture/dynamic_simd/mul.mdwn
index f6aba55727a2201bda431fadc9fd2e5288703f4b..08d1e198a6ca8d7f7fccd5a384b2d79791e8e825 100644 (file)
--- a/3d_gpu/architecture/dynamic_simd/mul.mdwn
+++ b/3d_gpu/architecture/dynamic_simd/mul.mdwn
@@ -9,3 +9,7 @@ Therefore, for a full 64 bit multiply, with 7 partitions, a matrix of 8x8 multip
 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)
 
 <img src="https://img.fireden.net/sci/image/1483/07/1483079339205.png" width="350px" />
+
+This image illustrates it well, except for the last step, "Step(v)", whose result should be "1 x 2 = 2".  The partitioned sum at the bottom is correct.
+
+