(no commit message)

diff --git a/3d_gpu/architecture/dynamic_simd/mul.mdwn b/3d_gpu/architecture/dynamic_simd/mul.mdwn
index 646c9cd4c8d7b6c7b2f3dd5883fede88c4d825a1..b350aac648967c8deb13da77ae12cadbc8dc9a0f 100644 (file)
--- a/3d_gpu/architecture/dynamic_simd/mul.mdwn
+++ b/3d_gpu/architecture/dynamic_simd/mul.mdwn
@@ -4,4 +4,8 @@
 
 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.
 
+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" />
+
 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)