Function approximation based on estimated arithmetic operators

Authors:
Arnaud Tisserand
Affiliations:
CNRS, IRISA, INRIA Centre Rennes-Bretagne Atlantique, Univ. Rennes 1, Lannion cedex, France
Venue:
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Year:
2009

Citing 6
Cited 0

Reciprocation, Square Root, Inverse Square Root, and Some Elementary Functions Using Small Multipliers

IEEE Transactions on Computers - Special issue on computer arithmetic
Multipartite Table Methods

IEEE Transactions on Computers
Computing machine-efficient polynomial approximations

ACM Transactions on Mathematical Software (TOMS)
Elementary Functions: Algorithms and Implementation

Elementary Functions: Algorithms and Implementation
High-performance hardware operators for polynomial evaluation

International Journal of High Performance Systems Architecture
Arithmetic data value speculation

ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article reports preliminary results on hardware operators for function evaluation with moderate average accuracy. The obtained operators provide a small average error on the input domain but a few large errors may occur for some very infrequent arguments. The proposed approximation method combines two methods: i) approximation using lowdegree polynomials with small and sparse coefficients; ii) operators for addition based on estimated arithmetic and integer power operators (x2, x3) with reduced accuracy. Typical delay reduction is about 20-50% and 15-30% for silicon area reduction compared to previous results.