• DocumentCode
    3170382
  • Title

    TGSCO: an algorithm for topology generation of clock tree with skew constraint and optimization

  • Author

    Liu, Yi ; Hong, Xianlong ; Yici Cai

  • Author_Institution
    Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China
  • Volume
    2
  • fYear
    2002
  • fDate
    29 June-1 July 2002
  • Firstpage
    1444
  • Abstract
    In this paper, a new clock tree topology generation algorithm TGSCO is proposed for the clock routing. The optimization includes two parts: a constructive stage followed by local topology refinement. During clock tree construction, the skew relationship between clock sinks is considered. Appropriate adjustment to the topology can reduce the delay and skew further. Voronoi diagram is used to accelerate computing. Different from previous methods, our algorithm can produce a clock tree with both balanced topology and short wire length. The experimental results show that the algorithm can control the skew constraints effectively, reduce total wire length, and find an optimized clock tree.
  • Keywords
    circuit layout CAD; circuit optimisation; clocks; computational geometry; network routing; network topology; trees (mathematics); TGSCO algorithm; Voronoi diagram; clock routing; clock tree topology generation; optimization; skew constraint; wire length; Circuit topology; Clocks; Computer science; Constraint optimization; Delay; Flip-flops; Iterative algorithms; Partitioning algorithms; Routing; Wire;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications, Circuits and Systems and West Sino Expositions, IEEE 2002 International Conference on
  • Print_ISBN
    0-7803-7547-5
  • Type

    conf

  • DOI
    10.1109/ICCCAS.2002.1179051
  • Filename
    1179051