Binary-Coded Ternary: Difference between revisions
From T729 Balanced Ternary Computer
Jump to navigationJump to search
No edit summary |
m (MrDyne moved page Binary-coded Ternary to Binary-Coded Ternary without leaving a redirect) |
||
| (4 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
<b> | <b>Binary-coded Ternary (BCT)</b> is an implementation of ternary logic built on top of normal binary logic. Using two bits or wires per trit as the base. Sub-circuits made with binary logic gates can emulate the truth tables of ternary logic gates. | ||
This implementation is useful with logic simulators and would most likely function on an FPGA | This implementation is useful with logic simulators and would most likely function on an FPGA. However because each trit needs two wires a design would be extremely bloated with interconnects and bus lines. Doubling the wiring and logic and loosing most of the advantages of a ternary computer. | ||
<div style="text-align: center;"> | <div style="text-align: center;"> | ||
<table class="tt"> | <table class="tt"> | ||
<tr> | <tr> | ||
<td colspan="3"> | <td colspan="3">BCT</td> | ||
</tr> | </tr> | ||
<tr> | <tr> | ||
Latest revision as of 17:27, 10 March 2025
Binary-coded Ternary (BCT) is an implementation of ternary logic built on top of normal binary logic. Using two bits or wires per trit as the base. Sub-circuits made with binary logic gates can emulate the truth tables of ternary logic gates.
This implementation is useful with logic simulators and would most likely function on an FPGA. However because each trit needs two wires a design would be extremely bloated with interconnects and bus lines. Doubling the wiring and logic and loosing most of the advantages of a ternary computer.
| BCT | ||
| N | P | T |
| 0 | 0 | 0 |
| 0 | 1 | + |
| 1 | 0 | - |
| 1 | 1 | ? |
