This is a technique I developed, which, instead of using a full adder for each individual bit, uses just one adder, and then iterates over all the bits in a number, ANDing it with a gate that gets left-shifted by one in each iteration.
Comments
-
Yeah here it is: id:2270717
-
Actually, i figured out how to turn a half-adder into full-adder. Actually how to turn an AND and a NOT gate into a N-bit adder.
-
@NoVIcE I can't wait to see your implementation!
-
Literally what i was thinking. Great! +1