This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Algorithms for Binary Coded Balanced and Ordinary Ternary Operations
February 1975 (vol. 24 no. 2)
pp. 212-215
G. Frieder, IBM Israel Scientific Center
A representation for binary coded ternary (BCT) numbers is proposed. This representation is then used for the introduction of algorithms for ternary addition and subtraction on binary hardware. In the algorithm introduced, distinction is made between basic algorithms, i.e., those which are independent of the type of the arithmetic, and those which are dependent upon it. Some suggestions as to the significance of this approach for nonternary arithmetic are presented.
Index Terms:
Computer arithmetic, microprogranmming, nonbinary logic.
Citation:
G. Frieder, C. Luk, "Algorithms for Binary Coded Balanced and Ordinary Ternary Operations," IEEE Transactions on Computers, vol. 24, no. 2, pp. 212-215, Feb. 1975, doi:10.1109/T-C.1975.224188
Usage of this product signifies your acceptance of the Terms of Use.