AbstractThis paper is a continuation of a study of numerical software for evaluating elementary functions in a microcomputer environment. Here we describe three algorithms for evaluation of the exponential function that are based on rationals, polynomials and coarse table look-up, respectively. Focus is on the design of fast algorithms that preserve full machine precision in small scale machines which use truncated binary fixed point arithmetic with at most a sixteen-bit wordlength. Included in the paper is a comparison of the performance of these algorithms implemented in two contemporary microcomputers
In this paper we extend the domain of applicability of the E-method [7, 8], as a hardware-oriented m...
International audienceWe present an automatic method for the evaluation of functions via polynomial ...
The paper presents a novel method of evaluating the square root function in FPGA. The method uses a ...
AbstractThis paper is a continuation of a study of numerical software for evaluating elementary func...
AbstractThis paper is a continuation of a study of numerical software for evaluating elementary func...
AbstractThis paper describes the implementation of rational approximation algorithms for evaluation ...
AbstractThis paper treats the evaluation of one of the elementary functions on short wordlength comp...
(eng) Many general table-based methods for the evaluation in hardware of elementary functions have b...
The evaluation of small degree polynomials is critical for the computation of elementary functions. ...
This paper presents a new scheme for the hardware evaluation of functions in fixed-point format, for...
Abstract: This study is concerned with designing and implementing a portable numerical software libr...
International audienceIn this paper we extend the domain of applicability of the E-method, as a hard...
We present an automatic method for the evaluation of functions via polynomial or rational approximat...
International audienceMany applications require the evaluation of some function through polynomial a...
Accurate table methods allow for very accurate and efficient evaluation of elementary functions. We ...
In this paper we extend the domain of applicability of the E-method [7, 8], as a hardware-oriented m...
International audienceWe present an automatic method for the evaluation of functions via polynomial ...
The paper presents a novel method of evaluating the square root function in FPGA. The method uses a ...
AbstractThis paper is a continuation of a study of numerical software for evaluating elementary func...
AbstractThis paper is a continuation of a study of numerical software for evaluating elementary func...
AbstractThis paper describes the implementation of rational approximation algorithms for evaluation ...
AbstractThis paper treats the evaluation of one of the elementary functions on short wordlength comp...
(eng) Many general table-based methods for the evaluation in hardware of elementary functions have b...
The evaluation of small degree polynomials is critical for the computation of elementary functions. ...
This paper presents a new scheme for the hardware evaluation of functions in fixed-point format, for...
Abstract: This study is concerned with designing and implementing a portable numerical software libr...
International audienceIn this paper we extend the domain of applicability of the E-method, as a hard...
We present an automatic method for the evaluation of functions via polynomial or rational approximat...
International audienceMany applications require the evaluation of some function through polynomial a...
Accurate table methods allow for very accurate and efficient evaluation of elementary functions. We ...
In this paper we extend the domain of applicability of the E-method [7, 8], as a hardware-oriented m...
International audienceWe present an automatic method for the evaluation of functions via polynomial ...
The paper presents a novel method of evaluating the square root function in FPGA. The method uses a ...