0 Tick 16 bit Kogge Stone Tree CLA Adder

[m477_]

A 16 bit version of the fastest adder there is, implemented with 0 tick piston logic. It took 2 days to build. Most of that time was spend debugging glitches with the pistons. This build was an experiment, although a kogge stone adder has the fastest real world performance, the size of the circuit slows down the server, so it loses a lot of it's performance gains.








Original CLA equations:
G = A * B
P = A xor B
Go = P * Gi + G
Po = P * Pi
Sum_i = P_i xor G_i-1

My redstone optimised version:
/G = /(A * B)
/P = //(/(A * /(A * B))) * /(B * /(A * B)))
/Go = //((/P + /Gi) * /G)
/Po = /P + /Pi
Sum_i = /(/(/P_i * /(/P_i * /Go_i-1))) * /(/Go_i-1 * /(/P_i * /Go_i-1)))

[EDevil]

Sorry, but i can't really say that i'm impressed. You just made an instant adder, it could be any type of adder; RPA, ICA, CLA, LFA, KSA, or even PLA. If its instant, it takes the fun out of optimizing an adder in the first place.

[tokumei]

Also, kogge stone isn't the best kind of addition implementation in MC. There are many other kinds, like EDevil said, that are much better for redstone.

[m477_]

I'm aware the ksa isn't the best addition implementation in mc, I'm also aware that an instant rca would have better performance because in an instant circuit, it doesn't matter if everything's parallel or serial if the server can only simulate one bit of redstone circuit at a time.

This isn't supposed to be useful or impressive, it was an experiment to see if a large circuit could be built using only instant logic gates. It works, but the pistons often break whenever parts of the circuit are modified with world edit.

[EDevil]

In that case then, great job My bad for judging your project too fast in the first place, you're very aware of what you made.

[Dcentrics]

Looks good to me EVIL... Need to be more appreciative