New pages

6 August 2025

• 10:5810:58, 6 August 2025 Rotate (BCT) (hist | edit) [116 bytes] MrDyne (talk | contribs) (Created page with "Rotate is done by Incrementing or Decrementing all trits individually.") Tag: Visual edit
• 10:5210:52, 6 August 2025 Shifts (BCT) (hist | edit) [322 bytes] MrDyne (talk | contribs) (Created page with "Register shifts are quite simple. The function doesn't involve any logic and is just a data line remapping. The work would happen further up with the actual register flip flops and or latches. none|thumb|473x473px|BCT Shift Right none|thumb|472x472px|BCT Shift Left") Tag: Visual edit

4 August 2025

• 17:2417:24, 4 August 2025 Multiplier (BCT) (hist | edit) [971 bytes] MrDyne (talk | contribs) (Created page with "{| class="wikitable" style="text-align: center; font-family: monospace; font-size: 18px;" |+ ! !3¹⁷ !3¹⁶ !3¹⁵ !3¹⁴ !3¹³ !3¹² !3¹¹ !3¹⁰ !3⁹ !3⁸ !3⁷ !3⁶ !3⁵ !3⁴ !3³ !3² !3¹ !3⁰ ! !B ! ! colspan="9" |A |- | | | | | | | | | | | + | - |0 |0 | + | - | + | - | + |= | + | rowspan="10"...") Tag: Visual edit: Switched
• 10:4910:49, 4 August 2025 Incrementer (BCT) (hist | edit) [335 bytes] MrDyne (talk | contribs) (Created page with "The fast carry lookahead incrementer can add or subtract one from an input in just 7 delays. none|thumb|BCT Fast Lookahead Incrementer") Tag: Visual edit

29 July 2025

• 11:0011:00, 29 July 2025 Adder (BCT) (hist | edit) [2,775 bytes] MrDyne (talk | contribs) (Created page with "Adder can add (and subtract) two numbers together. == Ripple Carry Adder == none|thumb|300x300px|BCT Ripple Carry Adder") Tag: Visual edit
• 10:5610:56, 29 July 2025 Full Adder (BCT) (hist | edit) [204 bytes] MrDyne (talk | contribs) (Created page with "Ternary Full Adder in BCT. Adds three tits and returns a sum and carry. It uses two Half Adder circuits. none|thumb|BCT Full Adder") Tag: Visual edit
• 10:4910:49, 29 July 2025 Half Adder (BCT) (hist | edit) [601 bytes] MrDyne (talk | contribs) (Created page with "Ternary Half Adder in BCT. This adds two trits and returns a sum and carry. Half Adders are building blocks of Full Adders. A normal binary half adder uses an XOR and AND gate. Converted to ternary that would be a SUM and CON gate. Due to the similar design of the BCT SUM and BCT CON gate we can actually get...") Tag: Visual edit
• 10:4010:40, 29 July 2025 MUX (BCT) (hist | edit) [359 bytes] MrDyne (talk | contribs) (Created page with "Ternary three-way Multiplexer in BCT. Allows the value of a trit to select one of three inputs. none|thumb|BCT Ternary Multiplexer") Tag: Visual edit
• 10:3810:38, 29 July 2025 DEC (BCT) (hist | edit) [162 bytes] MrDyne (talk | contribs) (Created page with "The Decrement and Rotate Up gate in BCT. none|thumb|BCT Decrement Gate") Tag: Visual edit
• 10:3610:36, 29 July 2025 INC (BCT) (hist | edit) [160 bytes] MrDyne (talk | contribs) (Created page with "The Increment and Rotate Up gate in BCT. none|thumb|BCT Increment Gate") Tag: Visual edit
• 10:3410:34, 29 July 2025 SUM (BCT) (hist | edit) [113 bytes] MrDyne (talk | contribs) (Created page with "The SUM gate in BCT. none|thumb|BCT Sum Gate") Tag: Visual edit
• 10:3310:33, 29 July 2025 EOR (BCT) (hist | edit) [197 bytes] MrDyne (talk | contribs) (Created page with "The EOR gate in BCT. It is named EOR to differentiate it from Binary XOR. none|thumb|BCT Exclusive Or Gate") Tag: Visual edit
• 10:3110:31, 29 July 2025 CON (BCT) (hist | edit) [125 bytes] MrDyne (talk | contribs) (Created page with "The Consensus gate in BCT. none|thumb|BCT Consensus Gate") Tag: Visual edit
• 10:2910:29, 29 July 2025 ANY (BCT) (hist | edit) [113 bytes] MrDyne (talk | contribs) (Created page with "The ANY gate in BCT. none|thumb|BCT Any Gate") Tag: Visual edit
• 10:2210:22, 29 July 2025 NEG (BCT) (hist | edit) [178 bytes] MrDyne (talk | contribs) (Created page with "frame|none|BCT Negate Gate The NEG (Ternary Gate) gate is as simple as it gets with BCT. Just swap the - and + wires.")

25 July 2025

• 11:0311:03, 25 July 2025 Custom Chip (hist | edit) [263 bytes] MrDyne (talk | contribs) (Created page with "A custom chip would likely be made in some form of CMOS using BCT. All other ternary implementations result in one of the three states creating a tiny short (usually voltage divider) which wastes power and creates heat.") Tag: Visual edit
• 10:2010:20, 25 July 2025 Full Adder (Logic) (hist | edit) [5,063 bytes] MrDyne (talk | contribs) (Created page with "thumb|alt=Logic gate layout for a binary full adder.|Binary Full Adder thumb|alt=Logic gate layout for a ternary full adder.|Ternary Full Adder")

22 May 2025

• 11:4911:49, 22 May 2025 AI Notice (hist | edit) [535 bytes] MrDyne (talk | contribs) (Created page with "Any AI generated content placed on this Wiki will be labeled as such. I do use chat AI as a "rubber ducky" to work out some tech and computer concepts. AI has not been used to do any direct work on this project yet. AI has not been used to edit or generate any pages on this Wiki, yet. I do mess around a lot with HTML5 and use one off .html files as project tools, e.g. generating Instruction Set Map. Stuff that should probably be done with Python; but I very much...")
• 00:0400:04, 22 May 2025 Multiply (Ternary) (hist | edit) [6,076 bytes] MrDyne (talk | contribs) (Created page with "<big><b>Ternary Multiply</b></big> == Uses == Multiplies two inputs together.")

20 May 2025

• 23:0623:06, 20 May 2025 ALU (hist | edit) [602 bytes] MrDyne (talk | contribs) (Created page with "'''Arithmetic Logic Unit''' preforms arithmetic and logic operations on data. It is a fundamental building block of most CPUs. ==References== * [https://en.wikipedia.org/wiki/Arithmetic_logic_unit Wikipedia Arithmetic Logic Unit]")

12 May 2025

• 10:5910:59, 12 May 2025 Rotate (Ternary) (hist | edit) [516 bytes] MrDyne (talk | contribs) (Created page with "<big><b>Register Rotate</b></big> Rotate left and right works very similar to Shift but what gets shifted out gets shifted in on the other end. Rotate up and down increment and decrement all trits. There are Logical and Arithmetic rotates where the ALU barrow/carry flag trit is excluded or included.")
• 10:4910:49, 12 May 2025 Shift (Ternary) (hist | edit) [387 bytes] MrDyne (talk | contribs) (Created page with "<big><b>Register Shift</b></big> Register shift, shifts all trits to the left or right. What is shifted in can be selected; negative, zero, positive. == Uses == A left shift will cube the result. A right shift will cube-root the result. === Logical === Logical shifts exclude the ALU barrow/carry flag trit. === Arithmetic === Arithmetic shifts include the ALU barrow/carry flag trit.")