Abstract
In this paper, we propose a practical ASIC methodology for flexible clock tree synthesis (CTS). The allowed flexibility for clock network leads us to be able to synthesize some complex clock networks which may contain clock driver, sequential components, buffers, inverters, gated components. Macro blockages are also allowed to be presented in clock routing area to make CTS more practical. With multiple timing constraints applied, our CTS method first introduces node clustering and buffering to construct an initial clock tree in a bottom-up fashion, pursuing the minimum clock skew with macro blockages eluded. Then tree node pulling up and buffer insertion may be used to further improve clock tree performances. Experiments of CTS program using this methodology show that our CTS method works very well for some complex clock networks with timing closure achieved.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bakoglu, H., Walker, J.T., Meindl, J.D.: A Symmetric clock-distribution tree and optimized high-speed interconnections for reduced clock skew in ULSI and WSI circuits. In: ICCD 1986, pp. 118–122 (1986)
Jackson, M.A.B., Srinivasan, A., Kuh, E.S.: Clock Routing for High-Performance ICs. In: 27th DAC, pp. 573–579 (1990)
Tsay, R.S.: Exact Zero Skew. In: ICCAD 1991, pp. 336–339 (1991)
Chao, T.H., Hsu, Y.C., Ho, J.M.: Zero Skew Clock Net Routing. In: 29th DAC, pp. 518– 513 (1992)
Li, Y.M., Jabri, M.A.: A Zero-Skew Clock Routing Scheme for VLSI Circuits. In: ICCAD 1992, pp. 458–463 (1992)
Edahiro, M.: A Clustering-Based Optimization Algorithm in Zero-Skew Routings. In: 30th DAC, pp. 612–616 (1993)
Edahiro, M.: An Efficient Zero-Skew Routing Algorithm. In: 31st DAC, pp. 375– 380 (1994)
Liu, I., Chou, T., Aziz, A., Wong, D.F.: Zero-Skew Clock Tree Construction by Simultaneous Routing, Wire Sizing and Buffer Insertion. In: ISPD 2000, pp. 33–38 (2000)
Huang, D.J., Kahng, A.B., Tsao, C.A.: On the Bounded-Skew Clock and Steiner Routing Problems. In: 32nd DAC, pp. 508–513 (1995)
Cong, J., Kahng, A.B., Koh, C.K., Tsao, C.W.A.: Bounded-Skew Clock and Steiner Routing Under Elmore Delay. In: ICCAD 1995, pp. 66–71 (1995)
Kahng, A.B., Tsao, C.A.: More Practical Bounded-Skew Clock Routing. In: 34th DAC, pp. 594–599 (1997)
Cho, J.D., Sarrafzadeh, M.: A Buffer Distribution Algorithm for High- Speed Clock Routing. In: 30th DAC, pp. 537–543 (1993)
Toyonaga, M., Kurokawa, K., Yasui, T., Takahashi, A.: A Practical Clock Tree Synthesis for Semi-Synchronous Circuits. In: ISPD 2000, pp. 159–164 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, D., Suaris, P., Chou, Nc. (2003). A Practical ASIC Methodology for Flexible Clock Tree Synthesis with Routing Blockages. In: Chico, J.J., Macii, E. (eds) Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation. PATMOS 2003. Lecture Notes in Computer Science, vol 2799. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39762-5_57
Download citation
DOI: https://doi.org/10.1007/978-3-540-39762-5_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20074-1
Online ISBN: 978-3-540-39762-5
eBook Packages: Springer Book Archive