Article dans revue scientifique avec comité de lecture.International audienceIn several cases, the input argument of an elementary function evaluation is given bit-serially, most significant bit first. We suggest a solution for performing the first step of the evaluation (namely, the range reduction) on the fly: the computation is overlapped with the reception of the input bits. This algorithm can be used for the trigonometric functions sin, cos, tan as well as for the exponential function. || Il arrive que l'opérande dont on doit calculer une fonction élémentaire soit disponible chiffre après chiffre, en série, en commençant par les poids forts. Nous proposons une solution permettant d'effectuer la première phase de l'évaluation (la réduct...
Sometimes, a function f of n variables can be represented as a com-position of two functions of fewe...
In this paper we present an algorithm for narrowing the constraint y = e x . The algorithm has be...
Exportado OPUSMade available in DSpace on 2019-08-11T09:38:42Z (GMT). No. of bitstreams: 1 raphaeler...
In several cases, the input argument of an elementary function evaluation is given bit-serially, mos...
(eng) In several cases, the input argument of an elementary function evaluation is given bit-seriall...
Range-reduction is a key point for getting accurate elementary function routines. We introduce a new...
Abstract: A new range reduction algorithm, called Modular Range Reduction (MRR), brie y introduced b...
Range reduction is a key point for getting accurate elementary function routines. We introduce a new...
International audienceSoftware evaluation of elementary functions usually requires three steps: a ra...
A new range reduction algorithm, called ModularRange Reduction (MRR), briefly introduced by the auth...
(eng) Range reduction is a key point for getting accurate elementary function routines. We introduce...
We describe a new implementation of the elementary transcendental functions exp, sin, cos, log and a...
Sometimes, a function f of n variables can be represented as a com-position of two functions of fewe...
When attempting to discover the function of a combinational digital electronic circuit without prior...
AbstractIn a recent paper by Aberth and Schaefer (1992), it was shown how an implementation of range...
Sometimes, a function f of n variables can be represented as a com-position of two functions of fewe...
In this paper we present an algorithm for narrowing the constraint y = e x . The algorithm has be...
Exportado OPUSMade available in DSpace on 2019-08-11T09:38:42Z (GMT). No. of bitstreams: 1 raphaeler...
In several cases, the input argument of an elementary function evaluation is given bit-serially, mos...
(eng) In several cases, the input argument of an elementary function evaluation is given bit-seriall...
Range-reduction is a key point for getting accurate elementary function routines. We introduce a new...
Abstract: A new range reduction algorithm, called Modular Range Reduction (MRR), brie y introduced b...
Range reduction is a key point for getting accurate elementary function routines. We introduce a new...
International audienceSoftware evaluation of elementary functions usually requires three steps: a ra...
A new range reduction algorithm, called ModularRange Reduction (MRR), briefly introduced by the auth...
(eng) Range reduction is a key point for getting accurate elementary function routines. We introduce...
We describe a new implementation of the elementary transcendental functions exp, sin, cos, log and a...
Sometimes, a function f of n variables can be represented as a com-position of two functions of fewe...
When attempting to discover the function of a combinational digital electronic circuit without prior...
AbstractIn a recent paper by Aberth and Schaefer (1992), it was shown how an implementation of range...
Sometimes, a function f of n variables can be represented as a com-position of two functions of fewe...
In this paper we present an algorithm for narrowing the constraint y = e x . The algorithm has be...
Exportado OPUSMade available in DSpace on 2019-08-11T09:38:42Z (GMT). No. of bitstreams: 1 raphaeler...