KetaThunberg
Biography
No biography added yet
Stats
8 / 16 / 32 bit CSA multipliers (Java & Bedrock)
Sequential multipliers that use Carry Save Adders in order to quickly add a bunch of numbers together. The CSA design used is the one shown in Bennyscube video:https://youtu.be/lbnwWWyT1yc?si=YGS6juerd17Re9MAIt runs on a 3t / bit loop, with 2t delay for every additional byte.. Should work just fine on Bedrock as well, although I have only tested the 32 bit one so far.
minecraft
KetaThunberg
mattbatwings
20 bit divider (Java & Bedrock)
20 bit sequential divider. Takes in two 20 bit numbers A, B as input and returns A // B (i.e. the integer quotient of A divided by B) and the remainder. Uses restoring division and runs on a clock-speed of 18t per bit (quite slow).Works on Java & Bedrock. Uses Mattbatwings' 5t CCA.
minecraft
32 / 31 bit divider
Sequential divider, takes inputs A (max. 32 bits) and B (max. 31 bits) and returns A // B, A % B. Uses non-restoring division method, and runs on a clockspeed of 11t per bit. The CCAs that are used are by Amino.
minecraft
KetaThunberg
mattbatwings
16 bit divider (Java & Bedrock)
16 bit sequential divider. Takes in two 16 bit numbers A,B, and returns the integer quotient as well as the remainder. Runs on a 15t per bit clock.Uses Mattbatwings 5t CCA. Works on Java & Bedrock.
minecraft
32 bit square root extractor
32 bit sequential square root extractor. Takes in a 32 bit number input and returns the rounded down square root, as well as the remainder. Uses the algorithm explained in Mattbatwings video:https://youtu.be/bnwsyYpf3GQ?si=gMd06RvJpv5iq0PzIt uses Aminos 3t CCA (extended to 32 bits) and runs on a clock speed of 18t per bit. It need 16 iterations. Faster design would be to use a non-restoring method, but it's gonna be twice as big.
minecraft
No Flows Yet
This user hasn't created any visual schematic flows yet.
KetaThunberg's Bookmarks
No bookmark collections found.
