From: lkcl Date: Sun, 27 Dec 2020 22:56:24 +0000 (+0000) Subject: (no commit message) X-Git-Tag: convert-csv-opcode-to-binary~776 X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=d8d9a50087b9e72583a1e58f3cb3cee3e049408a;p=libreriscv.git --- diff --git a/3d_gpu/architecture/dynamic_simd/logicops.mdwn b/3d_gpu/architecture/dynamic_simd/logicops.mdwn index f5ef39037..9bf5a4c43 100644 --- a/3d_gpu/architecture/dynamic_simd/logicops.mdwn +++ b/3d_gpu/architecture/dynamic_simd/logicops.mdwn @@ -16,6 +16,14 @@ they are instead SIMD versions of: for i in range(64): result = result or a[i] +# Requirements + +Given a signal width (typically 64) and given an array of "Partition Points" (typically 7) that break the signal down into an arbitrary permutaion of 8 bit to 64 bit independent results, compute the following: + +* xor of all bits in each partitioned group, regardless of the oartitioning +* "are some bits set" in each partitioned group +* "are all bits set" in each partitioned group + # bool (some operator) as an example instead of the above single 64 bit bool result, dynamic partitioned SIMD must return a batch of results. if the subdivision is 2x32 it is: