A simple yet effective merging scheme for prescribed-skew clock routing Conference Paper uri icon

abstract

  • In order to achieve multi-GHz operation frequency for VLSI design, clock networks need to be designed in a very elaborated manner and be able to deliver prescribed useful skews rather than merely zero-skew. Although traditional zero-skew clock routing methods can be extended directly to prescribed skews, they tend to result in excessive wirelength as the differences among delay-targets for clock sinks are neglected. In this paper, we propose the maximum delay-target and minimum merging-cost merging scheme for prescribed-skew clock routing. This scheme is simple yet surprisingly effective on wirelength reduction. Experimental results on benchmark circuits show that our merging scheme yields 53%-61% wirelength reduction compared to traditional clock routing methods.

name of conference

  • 21st International Conference on Computer Design

published proceedings

  • Proceedings 21st International Conference on Computer Design

author list (cited authors)

  • Rishi Chaturvedi, .., & Hu, J.

citation count

  • 7

complete list of authors

  • Hu, J

publication date

  • January 2003