6 search results - page 1 / 2 » Optimal allocation of carry-save-adders in arithmetic optimi... |
DAC
1998
ACM
15 years 4 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...
DATE
2006
IEEE
15 years 5 months ago
2006
IEEE
Carry Save Adder (CSA) trees are commonly used for high speed implementation of multi-operand additions. We present a method to reduce the number of the adders in CSA trees by ext...
ICCAD
1999
IEEE
15 years 4 months ago
1999
IEEE
: Carry-save-adder(CSA) is one of the most widely used schemes for fast arithmetic in industry. This paper provides a solution to the problem of finding an optimal-timing allocatio...
DAC
1997
ACM
15 years 3 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...
CC
2001
Springer
15 years 4 months ago
2001
Springer
We study the application of a standard model checker tool, Spin, to the well-known problem of computing a may-alias relation for a C program. A precise may-alias relation can signi...