35 search results - page 1 / 7 » The associative-skew clock routing problem |
ICCAD
1999
IEEE
13 years 9 months ago
1999
IEEE
We introduce the associative skew clock routing problem, which seeks a clock routing tree such that zero skew is preserved only within identified groups of sinks. The associative ...
DATE
2006
IEEE
13 years 10 months ago
2006
IEEE
ASPDAC
2012
ACM
12 years 14 days ago
2012
ACM
— In this paper, we present an obstacle-aware clock tree synthesis method for through-silicon-via (TSV)-based 3D ICs. A unique aspect of this problem lies in the fact that variou...
DAC
1995
ACM
13 years 8 months ago
1995
ACM
We study the minimum-costbounded-skewrouting tree (BST) problem under the linear delay model. This problem captures several engineering tradeoffs in the design of routing topologi...
ASPDAC
2005
ACM
13 years 6 months ago
2005
ACM
In modern VLSI designs, the increasingly severe power problem requests to minimize clock routing wirelength so that both power consumption and power supply noise can be alleviated...