From: mtnolan2640@5b3e5887a309d4a2372aaf5e76b851870f15ca92 Date: Wed, 12 Feb 2020 19:22:42 +0000 (+0000) Subject: (no commit message) X-Git-Tag: convert-csv-opcode-to-binary~3441 X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=fb711ffff7381d6b99906182ef45c3efdb0d002e;p=libreriscv.git --- diff --git a/3d_gpu/architecture/dynamic_simd/shift.mdwn b/3d_gpu/architecture/dynamic_simd/shift.mdwn index b4a3419ce..2b28d6f5d 100644 --- a/3d_gpu/architecture/dynamic_simd/shift.mdwn +++ b/3d_gpu/architecture/dynamic_simd/shift.mdwn @@ -12,9 +12,9 @@ QUESTION: should b1 be limited to min(b[8+4..8], 24), b2 be similarly limited to then, we compute the following matrix, with the first column output being the full width (32 bit), the second being only 24 bit, the third only 16 bit and finally the top part (comprising the most significant byte of a and b as input) being only 8 bit | a0 << b0 | a1 << b0 | a2 << b0 | a3 << b0 - | a0 << b1 | a1 << b1 | a2 << b1 | a3 << b1 - | a0 << b2 | a1 << b2 | a2 << b2 | a3 << b2 - | a0 << b3 | a1 << b3 | a2 << b3 | a3 << b3 + | | a1 << b1 | a2 << b1 | a3 << b1 + | | | a2 << b2 | a3 << b2 + | | | | a3 << b3 Where multiply would perform a cascading-add across those partial results, shift is different in that we *know* (assume) that for each shift-amount