SUM (Ternary Gate)
From TernaryWiki
Modulo-3 Sum
Uses
While there is a Ternary XOR gate, it's usefulness does not fit with what the Binary XOR can do. Another gate is needed to perform ternary addition.
SUM does mod 3 addition, returning the remainder.
It is also useful for cryptography and error correction being balanced, self-negating, associative, and commutative.
A ⊕ B = C
C ⊕ A = B
A ⊕ C = B
B ⊕ C = A
A ⊕ 0 = A
0 ⊕ A = A
Truth Tables
SUM
| SUM | B | |||
| - | 0 | + | ||
| A | - | + | - | 0 |
| 0 | - | 0 | + | |
| + | 0 | + | - | |
| SUM | ||
| A | B | Y |
| - | - | + |
| - | 0 | - |
| - | + | 0 |
| 0 | - | - |
| 0 | 0 | 0 |
| 0 | + | + |
| + | - | 0 |
| + | 0 | + |
| + | + | - |
NSUM
| NSUM | B | |||
| - | 0 | + | ||
| A | - | - | + | 0 |
| 0 | + | 0 | - | |
| + | 0 | - | + | |
| NSUM | ||
| A | B | Y |
| - | - | - |
| - | 0 | + |
| - | + | 0 |
| 0 | - | + |
| 0 | 0 | 0 |
| 0 | + | - |
| + | - | 0 |
| + | 0 | - |
| + | + | + |