nedoPC.org

Community of electronics hobbyists established in 2002

...
Atom Feed | View unanswered posts | View active topics It is currently 23 May 2017 20:24



Reply to topic  [ 7 posts ] 
[Ternary] FFUUTT-code 
Author Message
Maniac

Joined: 17 Sep 2012 16:36
Posts: 277
Location: 81.170.128.52
Reply with quote
I will shortly be adding FFUUTT-coding to tunguska. I just want to share the convention with you guys, see if you have any feedback or so.

It is a numbering system for commutative bivalent ternary operations. You simply set up a truth table in the following order

Code:
F F X5
F U X4 (= U F)
U U X3
U T X2 (= T U)
T T X1
T F X0 (= F T)


Where X5-X0 is the results of the operation, and then, to get the number of the operation, you simply treat them as a regular terary number.

N = 243*X5 + 81 * X4 + 27 * X3 + 9*X2 + 3*X1 + X0

So, AND would be given N = -322, XOR would be given N = 241, etc.


05 Aug 2008 08:25
Profile
Admin
User avatar

Joined: 09 Jan 2003 02:22
Posts: 15335
Location: New York
Reply with quote
Actually ANY ternary operation may not be commutative, so true operation table should have 9 trits, not 6 - see my 3niti alpha instruction set for operation OPB ;)

But if your idea was to put most possible operations to 1 tryte it's OK to think of only commutative ones


06 Aug 2008 21:15
Profile WWW
Maniac

Joined: 17 Sep 2012 16:36
Posts: 277
Location: 81.170.128.52
Reply with quote
Shaos wrote:
Actually ANY ternary operation may not be commutative, so true operation table should have 9 trits, not 6 - see my 3niti alpha instruction set for operation OPB ;)

But if your idea was to put most possible operations to 1 tryte it's OK to think of only commutative ones



The idea I had was to catalog the commutative operations, since non-commutative operations really don't make that much sense in a tritwise operator.

It is a subset of ternary operations that is more "usable" than non-commutative ones, not just because they're easier to understand, but they are a lot fewer than the just under 20,000 operations possible.


07 Aug 2008 12:58
Profile
Admin
User avatar

Joined: 09 Jan 2003 02:22
Posts: 15335
Location: New York
Reply with quote
I will think about hardware implementation of your "FFUUTT-code" to see if it's really simpler than full 9-trit "any binary op"


08 Aug 2008 21:29
Profile WWW
Maniac

Joined: 17 Sep 2012 16:36
Posts: 277
Location: 81.170.128.52
Reply with quote
If you have cheap ternary OR and AND gates it should reduce pretty nicely. Since

in1 AND in2 is min(in1, in2)

and

in1 OR in2 is max(in1, in2)

You could use that fact (and commutativity) to reduce the problem pretty significantly.


09 Aug 2008 05:06
Profile
Maniac

Joined: 17 Sep 2012 16:36
Posts: 277
Location: 81.170.128.52
Reply with quote
For convenience, I made a FFUUTT-code calculator here:

http://nedopc.org/ternary/tunguska/ffuutt.html


12 Aug 2008 15:15
Profile
Admin
User avatar

Joined: 09 Jan 2003 02:22
Posts: 15335
Location: New York
Reply with quote
eudoxie wrote:
For convenience, I made a FFUUTT-code calculator here:

http://nedopc.org/ternary/tunguska/ffuutt.html


I just put this file on our web-site to make it available

_________________
:eugeek: https://twitter.com/Shaos1973


11 Nov 2012 21:00
Profile WWW
Display posts from previous:  Sort by  
Reply to topic   [ 7 posts ] 

Who is online

Users browsing this forum: No registered users and 1 guest


You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot post attachments in this forum

Search for:
Jump to:  
Powered by phpBB® Forum Software © phpBB Group
Designed by ST Software.