KAHNG, A. B., AND TSAO, C.-W. A. 1997a. More practical bounded-skew clock routing. In Proceedings of the Design Automation Conference, 594--599. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Efficient Implementation of a Planar Clock Routing with the.. - Kim, Zhou (1998) (1 citation) (Correct)
....considerations as hierarchical buffering, rise time and overshoot constraints, obstacle checking, varying layer parasitics and congestions, and even the underlying design flow are often ignored. Recent works have also given practical methods for BST (P BST) which is non planar routing algorithm [4]. The timing optimization for the ACTD system is considered extensively in paper [1] Most well known academic clock routing research results are shown in Table 1. More detailed surveys of clock tree synthesis can be found in [7] 11] Page 3 1.2 Definitions First, we define basic conventions ....
A. Kahng, and C. Tsao, "More Practical Bounded-Skew Clock Routing," Proceedings of 34th ACM/IEEE Design Automation Conference, pp. 594-599, June, 1997.
Bounded-Skew Clock and Steiner Routing - Cong, Kahng, Koh, Tsao (1999) (4 citations) Self-citation (Kahng Tsao) (Correct)
No context found.
KAHNG, A. B., AND TSAO, C.-W. A. 1997a. More practical bounded-skew clock routing. In Proceedings of the Design Automation Conference, 594--599.
The Associative-Skew Clock Routing Problem - Chen, Kahng, Qu, Zelikovsky (1999) (1 citation) Self-citation (Kahng) (Correct)
....variant is Greedy DME [9] ffl More recently, it has been noted that exact zero skew comes at the price of increased wiring area and higher power dissipation, even as circuits still operate correctly within some non zero skew bound. Hence, the bounded skew tree (BST) problem was addressed in [14, 7, 16, 6]. The BST problem provides a continuous tradeoff between two classic routing problems the zero skew tree (ZST) problem for skew bound B = 0, and the rectilinear Steiner minimum tree (RSMT) problem for B = ffl Finally, Friedman and coauthors have pointed out that the classic zero skew ....
A. B. Kahng and C.-W. A. Tsao, "More Practical Bounded-Skew Clock Routing ", Proc. ACM/IEEE Design Automation Conference, Anaheim, 1997, pp. 594-599.
An Automatic Clock Tree Design System for High-Speed VLSI Designs.. - Kim (1999) (Correct)
No context found.
A. Kahng, and C. Tsao, "More Practical Bounded-Skew Clock Routing," Proceedings of 34th ACM/IEEE Design Automation Conference, pp. 594-599, June, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC