Full Adder (Logic)
From TernaryWiki
An example where Binary and Ternary logic work the same is the Full and Half adder. The full adder layout is identical. The only difference is using each logic base's primary logic gates.
- XOR = SUM
- AND = CON
- OR = ANY
Truth Tables
A | B | Ci | Co | S |
- | - | - | - | 0 |
- | - | 0 | - | + |
- | - | + | 0 | - |
- | 0 | - | - | + |
- | 0 | 0 | 0 | - |
- | 0 | + | 0 | 0 |
- | + | - | 0 | - |
- | + | 0 | 0 | 0 |
- | + | + | 0 | + |
0 | - | - | - | + |
0 | - | 0 | 0 | - |
0 | - | + | 0 | 0 |
0 | 0 | - | 0 | - |
0 | 0 | 0 | 0 | 0 |
0 | 0 | + | 0 | + |
0 | + | - | 0 | 0 |
0 | + | 0 | 0 | + |
0 | + | + | + | - |
+ | - | - | 0 | - |
+ | - | 0 | 0 | 0 |
+ | - | + | 0 | + |
+ | 0 | - | 0 | 0 |
+ | 0 | 0 | 0 | + |
+ | 0 | + | + | - |
+ | + | - | 0 | + |
+ | + | 0 | + | - |
+ | + | + | + | 0 |