SUM (Ternary Gate): Difference between revisions
From T729 Balanced Ternary Computer
Jump to navigationJump to search
No edit summary |
No edit summary |
||
Line 1: | Line 1: | ||
<big><b>Modulo-3 Sum</b></big> | <big><b>Modulo-3 Sum</b></big> | ||
[[File:SUM_GATE.png|thumb|Sum Gate Symbol]] | [[File:SUM_GATE.png|thumb|Sum Gate Symbol]] | ||
[[File: | [[File:BCT_SUM.png|thumb|BCT Sum Gate]] | ||
== Uses == | == Uses == | ||
While there is a [[EOR (Ternary Gate)|Ternary XOR]] gate, it's usefulness does not fit with what the [[XOR (Binary Gate)|Binary XOR]] can do. Another gate is needed to perform ternary addition. | While there is a [[EOR (Ternary Gate)|Ternary XOR]] gate, it's usefulness does not fit with what the [[XOR (Binary Gate)|Binary XOR]] can do. Another gate is needed to perform ternary addition. |
Latest revision as of 18:54, 21 January 2025
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 | - |
+ | + | + |