SUM (Ternary Gate): Difference between revisions
From T729 Balanced Ternary Computer
Jump to navigationJump to search
No edit summary |
No edit summary |
||
Line 2: | Line 2: | ||
<b>Modulo-3 Sum</b> | <b>Modulo-3 Sum</b> | ||
</p> | </p> | ||
== Uses == | |||
While there is a [[XOR Ternary Gate|ternary XOR]] gate, it's usefulness does not align with what the [[XOR Binary Gate|binary XOR]] can do. | |||
Sum does mod 3 addition, returning the remainder. Takes the place as an XOR in an adder. | |||
It is also useful for cryptography being symmetrical, self-negating, associative, and commutative. | |||
A ⊕ B = C<br /> | |||
C ⊕ A = B<br /> | |||
A ⊕ C = B<br /> | |||
B ⊕ C = A<br /> | |||
A ⊕ 0 = A<br /> | |||
0 ⊕ A = A<br /> | |||
== Truth Tables == | == Truth Tables == |
Revision as of 04:42, 29 May 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.
Sum does mod 3 addition, returning the remainder. Takes the place as an XOR in an adder.
It is also useful for cryptography being symmetrical, 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 | B | |||
- | 0 | + | ||
A | - | + | - | 0 |
0 | - | 0 | + | |
+ | 0 | + | - |
A | B | Y |
- | - | + |
- | 0 | - |
- | + | 0 |
0 | - | - |
0 | 0 | 0 |
0 | + | + |
+ | - | 0 |
+ | 0 | + |
+ | + | - |