Full Adder: The half adder is used to add only two numbers. To overcome this problem, the full adder was developed. The full adder is used to add three 1-bit binary numbers A, B, and carry C. The full adder has three input states and two output states i.e., sum and carry.
Block diagram
Truth Table
1. 'A' and 'B' are the input variables. These variables represent the two significant bits which are going to be added
2. 'Cin' is the third input which represents the carry. From the previous lower significant position, the carry bit is fetched.
3. The 'Sum' and 'Carry' are the output variables that define the output values.
4. The eight rows under the input variables designate all possible combinations of 0 and 1 that can occur in these variables.
The SOP form can be obtained with the help of K-map as:
Hence, from K-maps,
No comments:
Post a Comment