Sciweavers

12 search results - page 1 / 3
» Minimum area retiming with equivalent initial states
Sort
View
ICCAD
1997
IEEE
101views Hardware» more  ICCAD 1997»
13 years 9 months ago
Minimum area retiming with equivalent initial states
Traditional minimum area retiming algorithms attempt to achieve their prescribed objective with no regard to maintaining the initial state of the system. This issue is important f...
Naresh Maheshwari, Sachin S. Sapatnekar
VLSID
1999
IEEE
87views VLSI» more  VLSID 1999»
13 years 9 months ago
Optimal Retiming for Initial State Computation
Retiming is a transformation that optimizes a sequential circuit by relocating the registers. When the circuit has an initial state, one must compute an equivalent initial state f...
Peichen Pan, Guohua Chen
DAC
1997
ACM
13 years 9 months ago
An Improved Algorithm for Minimum-Area Retiming
The concept of improving the timing behavior of a circuit by relocating flip-flops is called retiming and was first presented by Leiserson and Saxe. The ASTRA algorithm propose...
Naresh Maheshwari, Sachin S. Sapatnekar
DAC
1999
ACM
14 years 6 months ago
Retiming for DSM with Area-Delay Trade-Offs and Delay Constraints
The concept of improving the timing behavior of a circuit by relocating registers is called retiming and was first presented by Leiserson and Saxe. They showed that the problem of...
Abdallah Tabbara, Robert K. Brayton, A. Richard Ne...
CAV
2001
Springer
80views Hardware» more  CAV 2001»
13 years 9 months ago
Transformation-Based Verification Using Generalized Retiming
In this paper we present the application of generalized retiming for temporal property checking. Retiming is a structural transformation that relocates registers in a circuit-based...
Andreas Kuehlmann, Jason Baumgartner