Abstract
The balanced clock routing algorithms have been researched by many people [7–16]. The goal is to develop a CAD tool, which can route the clock trees in the balanced form to minimize the clock skew. We will summarize the CAD algorithms developed by the author in the Ph.D. dissertation [122, 15,29]. Section 10.1 shows an algorithm to construct a planar equal path length clock tree. Section 10.2 discusses the embedding approach to transform an equal path clock tree with Manhattan wires. Section 10.3 shows a skew-bounded clock tree refinement method. Section 10.5 describes wire sizing technique and optimization flow for the clock skew reduction. Section 10.6 provides a summary of this chapter.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Zhu, Q.K. (2003). Balanced Clock Routing Algorithms. In: High-Speed Clock Network Design. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3705-9_10
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3705-9_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5336-0
Online ISBN: 978-1-4757-3705-9
eBook Packages: Springer Book Archive