ExplosivePowderGuy
ExplosivePowderGuy
3 / 0
1st Apr 2018
2nd Apr 2018
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

  • NoVIcE
    NoVIcE
    14th Apr 2018
    Yeah here it is: id:2270717
  • NoVIcE
    NoVIcE
    6th Apr 2018
    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.
  • ExplosivePowderGuy
    ExplosivePowderGuy
    5th Apr 2018
    @NoVIcE I can't wait to see your implementation!
  • NoVIcE
    NoVIcE
    3rd Apr 2018
    Literally what i was thinking. Great! +1