Full-Adder
Full-adder is a combinational circuit that can add three bits. The three bits include two significant bits and a previous carry. Full-adder is a combination of two half adders and an OR gate.
Truth Table
| Input | Output | |||
|---|---|---|---|---|
| x | y | Carry In | sum | carry Out |
| 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 1 | 0 |
| 0 | 1 | 0 | 1 | 0 |
| 0 | 1 | 1 | 0 | 1 |
| 1 | 0 | 0 | 1 | 0 |
| 1 | 0 | 1 | 0 | 1 |
| 1 | 1 | 0 | 0 | 1 |
| 1 | 1 | 1 | 1 | 1 |
Block diagram for full-adder