ICCAD
1995
IEEE
13 years 11 months ago
1995
IEEE
Abstract: Functions that map boolean vectors into the integers are important for the design and veri cation of arithmetic circuits. MTBDDs and BMDs have been proposed for represent...
FDTC
2006
Springer
13 years 11 months ago
2006
Springer
We present a new approach to fault tolerant public key cryptography based on redundant arithmetic in finite rings. Redundancy is achieved by embedding non-redundant field or ring ...
DELTA
2004
IEEE
13 years 11 months ago
2004
IEEE
Complex arithmetic computations, especially if derived from bit-level software descriptions, can be very inefficient if implemented directly in hardware (e.g., by translation of t...
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
We propose a new arithmetic reasoning calculus to speed up a SAT solver based on the Davis Putnam Longman Loveland (DPLL) procedure. It is based on an arithmetic bit level descrip...
CASES
2009
ACM
13 years 11 months ago
2009
ACM
2's complement number system imposes a fundamental limitation on the power and performance of arithmetic circuits, due to the fundamental need of cross-datapath carry propaga...
DAC
1997
ACM
13 years 11 months ago
1997
ACM
—Many application-specific architectures provide indirect addressing modes with auto-increment/decrement arithmetic. Since these architectures generally do not feature an indexe...
COMPGEOM
1997
ACM
13 years 11 months ago
1997
ACM
Abstract. In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact-computation paradigm and formalize the notion of degree o...
DAC
1998
ACM
13 years 11 months ago
1998
ACM
Carry-save-adder CSA is the most often used type of operation in implementing a fast computation of arithmetics of register-transfer level design in industry. This paper establis...
LICS
2002
IEEE
14 years 10 days ago
2002
IEEE
Tarski asked whether the arithmetic identities taught in high school are complete for showing all arithmetic equations valid for the natural numbers. The answer to this question f...
CHARME
2003
Springer
14 years 20 days ago
2003
Springer
Abstract. As of version 2.7, the ACL2 theorem prover has been extended to automatically verify sets of polynomial inequalities that include nonlinear relationships. In this paper w...