Sciweavers

33 search results - page 5 / 7
» Hardware Implementation Trade-Offs of Polynomial Approximati...
Sort
View
JGTOOLS
2008
109views more  JGTOOLS 2008»
13 years 7 months ago
Fast Equal-Area Mapping of the (Hemi)Sphere using SIMD
We present a fast vectorized implementation of a transform that maps points in the unit square to the surface of the sphere, while preserving fractional area. The mapping uses the ...
Petrik Clarberg
CADE
2009
Springer
14 years 2 months ago
Interpolant Generation for UTVPI
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...
Alessandro Cimatti, Alberto Griggio, Roberto Sebas...
COMPGEOM
2000
ACM
13 years 11 months ago
Fast computation of generalized Voronoi diagrams using graphics hardware
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...
ASAP
2000
IEEE
121views Hardware» more  ASAP 2000»
13 years 11 months ago
A Hardware Algorithm for Variable-Precision Logarithm
This paper presents an e cient hardware algorithm for variable-precision logarithm. The algorithm uses an iterative te chnique that employs table lookups and polynomial approximat...
Javier Hormigo, Julio Villalba, Michael J. Schulte
FPL
2010
Springer
104views Hardware» more  FPL 2010»
13 years 5 months ago
Multiplicative Square Root Algorithms for FPGAs
Abstract--Most current square root implementations for FPGAs use a digit recurrence algorithm which is well suited to their LUT structure. However, recent computing-oriented FPGAs ...
Florent de Dinechin, Mioara Joldes, Bogdan Pasca, ...