Multiplication of two numbers represented in base is shown to be computable by an on-line algorithm when is a negative integer, a positive non-integer real number, or a complex number of the form i r, where r is a positive integer
AbstractWe describe here a representation of computable real numbers and a set of algorithms for the...
International audienceWe describe here a representation of computable real numbers and a set of algo...
Complex number arithmetic computation is a key arithmetic feature in modern digital communication, r...
A Turing machine multiplies binary integers on-line if it receives its inputs, low-order digit first...
A class of on-line algorithms for complex number arith-metic is presented. These algorithms adopt a ...
AbstractLet β be a real number >1. The digit set conversion between real numbers represented in fixe...
It is shown that a function is computable by an on-the- y algorithm pro-cessing data in the most sig...
Number representations in computers are typically chosen for reasons of range and precision. Little ...
A Turing machine multiplies binary integers on-line if it receives its inputs, low-order digit first...
In this work, we present some VLSI structures suitable for on-line arithmetic embedded algorithms us...
For years complex numbers have been treated as distant relatives of real numbers despite their wides...
In this paper we present algorithms for a Boolean encoding of four basic arithmetic operations on in...
We present an algorithm allowing to perform integer multiplications by constants. This algorithm is ...
We present an algorithm allowing to perform integer multiplications by constants. This algorithm is ...
For years complex numbers have been treated as distant relatives of real numbers despite their wides...
AbstractWe describe here a representation of computable real numbers and a set of algorithms for the...
International audienceWe describe here a representation of computable real numbers and a set of algo...
Complex number arithmetic computation is a key arithmetic feature in modern digital communication, r...
A Turing machine multiplies binary integers on-line if it receives its inputs, low-order digit first...
A class of on-line algorithms for complex number arith-metic is presented. These algorithms adopt a ...
AbstractLet β be a real number >1. The digit set conversion between real numbers represented in fixe...
It is shown that a function is computable by an on-the- y algorithm pro-cessing data in the most sig...
Number representations in computers are typically chosen for reasons of range and precision. Little ...
A Turing machine multiplies binary integers on-line if it receives its inputs, low-order digit first...
In this work, we present some VLSI structures suitable for on-line arithmetic embedded algorithms us...
For years complex numbers have been treated as distant relatives of real numbers despite their wides...
In this paper we present algorithms for a Boolean encoding of four basic arithmetic operations on in...
We present an algorithm allowing to perform integer multiplications by constants. This algorithm is ...
We present an algorithm allowing to perform integer multiplications by constants. This algorithm is ...
For years complex numbers have been treated as distant relatives of real numbers despite their wides...
AbstractWe describe here a representation of computable real numbers and a set of algorithms for the...
International audienceWe describe here a representation of computable real numbers and a set of algo...
Complex number arithmetic computation is a key arithmetic feature in modern digital communication, r...
Add to ORKG