SUM (Ternary Gate): Difference between revisions

From T729 Balanced Ternary Computer
Jump to navigationJump to search
No edit summary
No edit summary
Line 10: Line 10:
It is also useful for cryptography being symmetrical, self-negating, associative, and commutative.
It is also useful for cryptography being symmetrical, self-negating, associative, and commutative.


<i>
A ⊕ B = C<br />
A ⊕ B = C<br />
C ⊕ A = B<br />
C ⊕ A = B<br />
Line 16: Line 17:
A ⊕ 0 = A<br />
A ⊕ 0 = A<br />
0 ⊕ A = A<br />
0 ⊕ A = A<br />
 
</i>
== Truth Tables ==
== Truth Tables ==
<div class="tt">
<div class="tt">

Revision as of 04:45, 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. A Half and Full Adder use SUM in place of an XOR.

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 +
+ + -