Full Adder: Difference between revisions
FoxFireFive (talk | contribs) Created page for full adder |
FoxFireFive (talk | contribs) m moved image |
||
| Line 1: | Line 1: | ||
{{Stub}} | {{Stub}}[[File:FullAdderExampleFixed.png|alt=A full adder circuit built in logic world.|thumb|Example of a Full Adder.]]A full adder is a simple circuit that adds two bits together along with a carry bit. | ||
[[File:FullAdderExampleFixed.png|alt=A full adder circuit built in logic world.|thumb|Example of a Full Adder.]] | |||
They have three inputs: A, B, Carry-In (CI), and two outputs: Sum (S) and Carry-Out (CO). | They have three inputs: A, B, Carry-In (CI), and two outputs: Sum (S) and Carry-Out (CO). | ||
{{Truth table|0 0 0 0 0|1 0 0 1 0|0 1 0 1 0|1 1 0 0 1|0 0 1 1 0|1 0 1 0 1|0 1 1 0 1|1 1 1 1 1|caption=Full Adder Truth Table|inputs=A, B, CI|outputs=S, CO}} | {{Truth table|0 0 0 0 0|1 0 0 1 0|0 1 0 1 0|1 1 0 0 1|0 0 1 1 0|1 0 1 0 1|0 1 1 0 1|1 1 1 1 1|caption=Full Adder Truth Table|inputs=A, B, CI|outputs=S, CO}} | ||
Latest revision as of 08:26, 12 January 2026
A full adder is a simple circuit that adds two bits together along with a carry bit.
They have three inputs: A, B, Carry-In (CI), and two outputs: Sum (S) and Carry-Out (CO).
| A | B | CI | S | CO |
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 1 | 0 |
| 0 | 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 0 | 1 |
| 0 | 0 | 1 | 1 | 0 |
| 1 | 0 | 1 | 0 | 1 |
| 0 | 1 | 1 | 0 | 1 |
| 1 | 1 | 1 | 1 | 1 |