Sciweavers

27 search results - page 1 / 6
» An Improved Algorithm for Minimum-Area Retiming
Sort
View
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
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
DAC
1999
ACM
14 years 5 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...
ALGORITHMICA
1998
143views more  ALGORITHMICA 1998»
13 years 4 months ago
On Minimum-Area Hulls
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
Esther M. Arkin, Yi-Jen Chiang, Martin Held, Josep...
ICCAD
2001
IEEE
108views Hardware» more  ICCAD 2001»
14 years 1 months ago
Placement Driven Retiming with a Coupled Edge Timing Model
Retiming is a widely investigated technique for performance optimization. It performs powerful modifications on a circuit netlist. However, often it is not clear, whether the pred...
Ingmar Neumann, Wolfgang Kunz