Half-Adder
Click on an input or a row on the truth table to change the addends.
A half-adder adds two bits and produces the sum and the carry as outputs. The operation performed by the half-adder is similar to the operation that occurs in the least significant bit when adding two binary numbers. There is no carry coming from the previous digit, we just add the least significant bits and write the result to the sum and provided that a carry occurs we pass it to the next digit.
The truth table of a half-adder is as follows:
In this table, x and y represent the addends, S represents the sum and C represents the carry to the next digit. The carry occurs only when both addends are equal to logic-1. The sum is equal to 1 when only one of the addends is 1, otherwise it is 0.
Two possible circuit implementations of a half adder circuit are illustrated above.
Half adder learning tool,
You can select the input values yourself or set them randomly.
To toggle the input values between 1 and 0, click on the inputs of circuits or the block diagram.
Or click on any row on the truth table to set the input values.
The DIE ICON generates a random set of values for the inputs.
You can download the solution as an image file with .jpg extension if you click on the "Download Solution" link at the bottom of the solution panel. You can share the downloaded image file.
Half-Adder