2 search results - page 1 / 1 » Timing-driven placement based on monotone cell ordering cons... |
ASPDAC
2006
ACM
14 years 23 days ago
2006
ACM
− In this paper, we present a new timing-driven placement algorithm, which attempts to minimize zigzags and crisscrosses on the timing-critical paths of a circuit. We observed th...
ICCAD
2004
IEEE
14 years 3 months ago
2004
IEEE
—In this paper, we present a new block budgeting algorithm which speeds up timing closure in timing driven hierarchical flows. After a brief description of the addressed flow, ...