SUM (Ternary Gate): Difference between revisions
From T729 Balanced Ternary Computer
Jump to navigationJump to search
(→NSUM) |
No edit summary |
||
Line 111: | Line 111: | ||
<hr /> | <hr /> | ||
=== | === ASUM === | ||
[[File:NSUM_GATE.png|thumb|alt= | [[File:NSUM_GATE.png|thumb|alt=Anti-Sum Gate Symbol|Anti-Sum Gate Symbol]] | ||
<div class="tt"> | <div class="tt"> | ||
<table class="tt"> | <table class="tt"> | ||
<tr> | <tr> | ||
<td class="tt_br tt_bb" colspan="2" rowspan="2"> | <td class="tt_br tt_bb" colspan="2" rowspan="2">ASUM</td> | ||
<td colspan="3" class="tce"><b>B</b></td> | <td colspan="3" class="tce"><b>B</b></td> | ||
</tr> | </tr> | ||
Line 147: | Line 147: | ||
<table class="tt"> | <table class="tt"> | ||
<tr> | <tr> | ||
<td colspan="3"> | <td colspan="3">ASUM</td> | ||
</tr> | </tr> | ||
<tr> | <tr> |
Revision as of 15:01, 29 August 2024
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 | + |
+ | + | - |
ASUM

ASUM | B | |||
- | 0 | + | ||
A | - | - | + | 0 |
0 | + | 0 | - | |
+ | 0 | - | + |
ASUM | ||
A | B | Y |
- | - | - |
- | 0 | + |
- | + | 0 |
0 | - | + |
0 | 0 | 0 |
0 | + | - |
+ | - | 0 |
+ | 0 | - |
+ | + | + |