On the optimality of ternary arithmetic for compactness and hardware design

10/25/2016
by   Harris V. Georgiou, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/24/2020

On the Expressiveness of Büchi Arithmetic

We show that the existential fragment of Büchi arithmetic is strictly le...
research
03/15/2018

Rigid models of Presburger arithmetic

We present a description of rigid models of Presburger arithmetic (i.e.,...
research
11/09/2018

Decidability, arithmetic subsequences and eigenvalues of morphic subshifts

We prove decidability results on the existence of constant subsequences ...
research
09/17/2018

Algorithmic Obfuscation over GF(2^m)

Galois Field arithmetic blocks are the key components in many security a...
research
03/22/2022

Arithmetic crosscorrelation of pseudorandom binary sequences of coprime periods

The (classical) crosscorrelation is an important measure of pseudorandom...
research
09/01/2023

Yet another Improvement of Plantard Arithmetic for Faster Kyber on Low-end 32-bit IoT Devices

This paper presents another improved version of Plantard arithmetic that...
research
04/08/2023

Arithmetic Intensity Balancing Convolution for Hardware-aware Efficient Block Design

As deep learning advances, edge devices and lightweight neural networks ...

Please sign up or login with your details

Forgot password? Click here to reset