Could someone show me a creation which is a binary adder that is SMALLER than this. (I won't copy it I just want some help with it. I have made one smaller but is is pretty over complicated, big and a bit slow)
(Note that the blueprint for the full adder is false on wikipedia.)
Read up about it on wikipedia, then use the other site for the right blueprints. If you don't know anything about logic gates, especially xor/and gates, then wiki that first.
You must not overcomplicated binary addition, it can be done simply. This is a working example of the method outlined by Synergy (I think I didn't really look into it.)
The XOR's add the two inputs and then carry the one. This is actually reflected in decimal addition:
5+7=10 with a remainder of 2 therefore the "10" is carried over to make a one and the two is left.
0101+0111= The two on the right add to make 2 with a remainder of 0 therefore the "2" is carried over to make the one and the 0 is left. This process is repeated... 0101+0111= 1100
I know you probably didn't need a lecture on binary but when you compare binary to decimal and realize it is similar and that they do work in the same way, just using different representations of numbers, it is a bit easier to make binary addition systems.
its looks like too complex binaty addition it just xor as the first nuber and and as the second number (both logic gates use the same numbers(ech number from other readed number)and again