70 search results - page 5 / 14 » Table-based polynomials for fast hardware function evaluatio... |
CAV
2011
Springer
13 years 1 months ago
2011
Springer
Abstract. Quantified Boolean formulae (QBF) allow compact encoding of many decision problems. Their importance motivated the development of fast QBF solvers. Certifying the result...
ICCAD
1995
IEEE
14 years 1 months ago
1995
IEEE
This paper addresses the problem of speeding up functional (delayindependent)logic simulation for synchronousdigital systems. The problem needs very little new motivation – cycl...
ASPDAC
2006
ACM
14 years 3 months ago
2006
ACM
— This paper presents an architecture and a synthesis method for programmable numerical function generators (NFGs) for trigonometric, logarithmic, square root, and reciprocal fun...
RT
1998
Springer
14 years 2 months ago
1998
Springer
The paper presents a single-pass, view-dependent method to solve the general rendering equation, using a combined finite element and random walk approach. Applying finite element t...
FCCM
2007
IEEE
14 years 4 months ago
2007
IEEE
This paper proposes optimizations of the methods and parameters used in both mathematical approximation and hardware design for logarithmic number system (LNS) arithmetic. First, ...