01-22-2016, 04:53 AM
(This post was last modified: 01-22-2016, 05:02 AM by LambdaPI.
Edit Reason: 4 bits not 4 ticks
)
I am LambdaPI by the way.
So in school i was extremely bored, and i was trying to invent faster ways of implementing the CCA method of adding. The main problem of piston-less CCA, is that the XNOR takes 2 ticks to finish,and there's no 1 tick flat XNOR.
The main problem of the 4 tick CCA is the XNOR. But in what was are XNORs made? Well, we can either invert the output of a XOR, or we can invert one input of a XOR.
What does a CCA consist of? Well the carry logic consists of a XNOR and a NOR. Now to fix the 2 tick XNOR problem, we ASSUME that one of the inputs is inverted. This means that we now have to change the XNOR to a XOR, and also the NOR to a B nimplies A gate. Below is a picture explanation of this.
![[Image: B3QB02Q.png?1]](http://i.imgur.com/B3QB02Q.png?1)
A nimplies gate can also be made 1 tick with a comparator. Using these, i created a 3 tick CCA with 1 set of inverted inputs. It cannot go past 4 bits, because the signal strength dies out, and in order to propagate it without delay, pistons are needed. Below is the image of the finished 3 tick CCA.
![[Image: l0oXjtZ.png?1]](http://i.imgur.com/l0oXjtZ.png?1)
Now the neat part about this, is that if you ALU this adder, i.e make an ALU from it, you can use the inversion XORs to invert the inverted input of the adder. That last sentence might sound a little wierd, but the point is, instead of inverting when invert signal is on, you invert when the signal is off. This is only for the CCA's inverted inputs. The others are conditionally inverted as usual.
I am currently working on ALUing this CCA, if you want to take a look at it, do /warp 3TPLCCA
So in school i was extremely bored, and i was trying to invent faster ways of implementing the CCA method of adding. The main problem of piston-less CCA, is that the XNOR takes 2 ticks to finish,and there's no 1 tick flat XNOR.
The main problem of the 4 tick CCA is the XNOR. But in what was are XNORs made? Well, we can either invert the output of a XOR, or we can invert one input of a XOR.
What does a CCA consist of? Well the carry logic consists of a XNOR and a NOR. Now to fix the 2 tick XNOR problem, we ASSUME that one of the inputs is inverted. This means that we now have to change the XNOR to a XOR, and also the NOR to a B nimplies A gate. Below is a picture explanation of this.
A nimplies gate can also be made 1 tick with a comparator. Using these, i created a 3 tick CCA with 1 set of inverted inputs. It cannot go past 4 bits, because the signal strength dies out, and in order to propagate it without delay, pistons are needed. Below is the image of the finished 3 tick CCA.
Now the neat part about this, is that if you ALU this adder, i.e make an ALU from it, you can use the inversion XORs to invert the inverted input of the adder. That last sentence might sound a little wierd, but the point is, instead of inverting when invert signal is on, you invert when the signal is off. This is only for the CCA's inverted inputs. The others are conditionally inverted as usual.
I am currently working on ALUing this CCA, if you want to take a look at it, do /warp 3TPLCCA
