16 hours ago
Takes in a 32 bit number A and returns Q = floor(cbroot(A)) as well as the remainder R, i.e. A = Q^3 + R.
It runs on a (horrible) clockspeed of 28t per bit, and it needs 11 iterations, i.e. in total it's gonna take over 30 seconds.
It uses the restoring shift-and-subtract algorithm. It can be made substantially faster (but also bigger) if we use a non-restoring method.
I used Aminos 3t CCA design for all the adders.
Java only.
16,697
Blocks
44,268
Volume
21 × 68 × 31
Dimensions
schem
Format
Comments
0
More like this
View all
↵
select
↑↓
navigate
esc
close
5 results
3 plugins loaded
minecraft
redstone