AbstractVon Neumann’s addition method adds two numbers given in q-ary representation by forming a number consisting of the added digits, reduced modulo q, and another number, representing the carries and repeating this until the string of carries consists only of zeros. The average number of iterations was studied by Knuth.We extend these results by considering the (q,d) system, with base q and digits d,d+1,…,d+q−1, as well as the symmetric signed digit expansions, for even q, with digits −q/2,…,q/2, and a special rule to make representations of integers unique
We investigate the existence of simultaneous representations of real numbers x in bases 1 < q1< ⯠<...
Güntzer and Paul introduced a number system with base 2 and digits −1, 0, 1 which is characterized b...
AbstractWe discuss an optimal method for the computation of linear combinations of elements of Abeli...
AbstractVon Neumann’s addition method adds two numbers given in q-ary representation by forming a nu...
This paper deals with pairs of integers, written in base two expansions using digits 0, ±1. Represen...
Suppose that a random n-bit number V is multiplied by an odd constant M ≥ 3, by adding shifted versi...
Our goal in this paper is to analyze carry propagation in addition using only elementary methods (th...
This paper deals with pairs of integers, written in base two expansions using digits 0,±1. Represent...
A new method for representing positive integers and real numbers in a rational base is considered. I...
AbstractÐAssuming signed digit number representations, we investigate the implementation of some add...
We consider digit expansions in base q ≥ 2 with arbitrary integer digits such that the length of the...
Redundant number representations are generally used to allow constant time additions, based on the f...
Applications of signed digit representations of an integer include computer arith-metic, cryptograph...
summary:Binary signed digit representations (BSDR's) of integers have been studied since the 1950's....
From a combinatorial perspective, we can count the number of carries that are needed to perform any ...
We investigate the existence of simultaneous representations of real numbers x in bases 1 < q1< ⯠<...
Güntzer and Paul introduced a number system with base 2 and digits −1, 0, 1 which is characterized b...
AbstractWe discuss an optimal method for the computation of linear combinations of elements of Abeli...
AbstractVon Neumann’s addition method adds two numbers given in q-ary representation by forming a nu...
This paper deals with pairs of integers, written in base two expansions using digits 0, ±1. Represen...
Suppose that a random n-bit number V is multiplied by an odd constant M ≥ 3, by adding shifted versi...
Our goal in this paper is to analyze carry propagation in addition using only elementary methods (th...
This paper deals with pairs of integers, written in base two expansions using digits 0,±1. Represent...
A new method for representing positive integers and real numbers in a rational base is considered. I...
AbstractÐAssuming signed digit number representations, we investigate the implementation of some add...
We consider digit expansions in base q ≥ 2 with arbitrary integer digits such that the length of the...
Redundant number representations are generally used to allow constant time additions, based on the f...
Applications of signed digit representations of an integer include computer arith-metic, cryptograph...
summary:Binary signed digit representations (BSDR's) of integers have been studied since the 1950's....
From a combinatorial perspective, we can count the number of carries that are needed to perform any ...
We investigate the existence of simultaneous representations of real numbers x in bases 1 < q1< ⯠<...
Güntzer and Paul introduced a number system with base 2 and digits −1, 0, 1 which is characterized b...
AbstractWe discuss an optimal method for the computation of linear combinations of elements of Abeli...