Sciweavers

208 search results - page 4 / 42
» Arithmetic Operations in the Polynomial Modular Number Syste...
Sort
View
ICCAD
2008
IEEE
127views Hardware» more  ICCAD 2008»
16 years 22 days ago
Verification of arithmetic datapaths using polynomial function models and congruence solving
Abstract— This paper addresses the problem of solving finite word-length (bit-vector) arithmetic with applications to equivalence verification of arithmetic datapaths. Arithmet...
Neal Tew, Priyank Kalla, Namrata Shekhar, Sivaram ...
116
Voted
JC
2008
77views more  JC 2008»
15 years 3 months ago
A numerical algorithm for zero counting, I: Complexity and accuracy
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(log(nD(f))) iterations (grid refinements) where n is...
Felipe Cucker, Teresa Krick, Gregorio Malajovich, ...
131
Voted
JCP
2008
145views more  JCP 2008»
15 years 3 months ago
Impact of Shift Operations on (-1+j)-Base Complex Binary Numbers
Complex numbers play a very important role in various applications of electrical and computer engineering. These days, arithmetic operations dealing with these numbers rely on a &q...
Tariq Jamil
COMPGEOM
1997
ACM
15 years 8 months ago
Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision
Abstract: We propose an e cient method that determines the sign of a multivariate polynomial expression with integer coe cients. This is a central operation on which the robustness...
Hervé Brönnimann, Ioannis Z. Emiris, V...
ASAP
1996
IEEE
94views Hardware» more  ASAP 1996»
15 years 8 months ago
A New Euclidean Division Algorithm For Residue Number Systems
We propose in this paper a new algorithm and architecture for performing divisions in residue number systems. Our algorithm is suitable for residue number systems with large modul...
Jean-Claude Bajard, Laurent-Stéphane Didier...