10 search results - page 1 / 2 » Timing optimization by bit-level arithmetic transformations |
EURODAC
1995
IEEE
13 years 8 months ago
1995
IEEE
This paper describes a method to optimize the performance of data paths. It is based on bit-level arithmetic transformations, and is especially suited to optimize large adder stru...
ICCD
2004
IEEE
14 years 1 months ago
2004
IEEE
This paper proposes a new formalism for layout-driven optimization of datapaths. It is based on preserving an arithmetic bit level representation of the arithmetic circuit portion...
ASPDAC
2008
ACM
13 years 5 months ago
2008
ACM
—In this paper we describe a practical methodology to formally verify highly optimized, industrial multipliers. We a multiplier description language which abstracts from low-leve...
TPCD
1994
13 years 6 months ago
1994
Theorem proving techniques are particularly well suited for reasoning about arithmetic above the bit level and for relating di erent f abstraction. In this paper we show how a non-...
DAC
1998
ACM
13 years 9 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...