70 search results - page 1 / 14 » Table-based polynomials for fast hardware function evaluatio... |
ARITH
2003
IEEE
13 years 10 months ago
2003
IEEE
We aim at evaluating elementary and special functions using small tables and small, rectangular, multipliers. To do that, we show how accurate polynomial approximations whose orde...
ASAP
2005
IEEE
13 years 10 months ago
2005
IEEE
ASAP
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--Polynomial approximation is a very general technique for the evaluation of a wide class of numerical functions of one variable. This article details an architecture gener...
FPL
2003
Springer
13 years 10 months ago
2003
Springer
This paper presents a method for evaluating functions in hardware based on polynomial approximation with non-uniform segments. The novel use of nonuniform segments enables us to ap...
ASAP
2004
IEEE
13 years 8 months ago
2004
IEEE
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...