Preprint Open Access

On the optimality of ternary arithmetic for compactness and hardware design

Harris Georgiou

Abstract

In this paper, the optimality of ternary arithmetic is investigated under strict mathematical formulation. The arithmetic systems are presented in generic form, as the means to encode numeric values, and the choice of radix is asserted as the main parameter to assess the efficiency of the representation, in terms of information compactness and estimated implementation cost in hardware. Using proper formulations for the optimization task, the universal constant e (base of natural logarithms) is proven as the most efficient radix and ternary is asserted as the closest integer choice.

Files (377.4 kB)
Name Size
binary-ternary-arithmetic.pdf
md5:a2053fa2befe2d0b8aff28e6bbe0b2db
377.4 kB Download
0
8
views
downloads
All versions This version
Views 00
Downloads 88
Data volume 3.0 MB3.0 MB
Unique views 00
Unique downloads 55

Share

Cite as