Algorithms for Ternary Number System

Numbers are counted in twos by machines, and in tens by men. However, there are countably infinite numbers of ways of counting numbers, in general. It has been shown that for optimum number of computations in counting a number, the base-e number system is the most preferred. Since the number 3 is th...

Full description

Saved in:
Bibliographic Details
Published in:Procedia technology 2012, Vol.4, p.278-285
Main Authors: Das, Subrata, Sain, Joy Prakash, Dasgupta, Parthasarathi, Sensarma, Samar
Format: Article
Language:English
Subjects:
Arithmetic operations
Rotational symmetry
Ternary number
Trits
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Numbers are counted in twos by machines, and in tens by men. However, there are countably infinite numbers of ways of counting numbers, in general. It has been shown that for optimum number of computations in counting a number, the base-e number system is the most preferred. Since the number 3 is the integer nearest to e, we focus on a number system with base 3. In this paper, we discuss a few important existing algorithms and propose related novel algorithms for some fundamental computations.
ISSN:2212-0173
2212-0173
DOI:10.1016/j.protcy.2012.05.043