SUM (Ternary Gate): Difference between revisions
From T729 Balanced Ternary Computer
Jump to navigationJump to search
No edit summary |
(→Uses) |
||
Line 6: | Line 6: | ||
SUM does mod 3 addition, returning the remainder. A Half and Full Adder use SUM in place of an XOR. | SUM does mod 3 addition, returning the remainder. A Half and Full Adder use SUM in place of an XOR. | ||
It is also useful for cryptography being | It is also useful for cryptography being balanced, self-negating, associative, and commutative. | ||
<i> | <i> | ||
Line 16: | Line 16: | ||
0 ⊕ A = A<br /> | 0 ⊕ A = A<br /> | ||
</i> | </i> | ||
== Truth Tables == | == Truth Tables == | ||
=== SUM === | === SUM === |
Revision as of 01:16, 11 June 2024
Modulo-3 Sum
Uses
While there is a Ternary XOR gate, it's usefulness does not align with what the Binary XOR can do. Another gate is needed to perform ternary addition.
SUM does mod 3 addition, returning the remainder. A Half and Full Adder use SUM in place of an XOR.
It is also useful for cryptography 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 | + | - |
A | B | Y |
- | - | + |
- | 0 | - |
- | + | 0 |
0 | - | - |
0 | 0 | 0 |
0 | + | + |
+ | - | 0 |
+ | 0 | + |
+ | + | - |
NSUM
NSUM | B | |||
- | 0 | + | ||
A | - | - | + | 0 |
0 | + | 0 | - | |
+ | 0 | - | + |
A | B | Y |
- | - | - |
- | 0 | + |
- | + | 0 |
0 | - | + |
0 | 0 | 0 |
0 | + | - |
+ | - | 0 |
+ | 0 | - |
+ | + | + |