Addition of n-bit binary numbers requires the use of a full adder, and the process of addition proceeds on a bit-by-bit basis, right to left, beginning with the least significant bit. After the least significant bit, addition at each position adds not only the respective bits of the words, but must also consider a possible carry bit from addition at the previous position.
A full adder is a combinational circuit that forms the arithmetic sum of three bits. It consists of three inputs and two outputs.
Watch out
1-bit magnitude comparator - https://youtu.be/3BiSCqXXGo0
parity generator in hindi - https://youtu.be/iqzNfHzxugM
half adder in hindi- https://youtu.be/fXzyQ2UoO_4
Digital Electronics playlist - https://www.youtube.com/playlist?list=PLp76zJxzEriOduaVO876EseoqmNx-CBYU
For more stuff subscribe our YouTube channel study extent
