Fast clock tree generation using exact zero skew clock routing algorithm
A Zero Skew clock routing methodology has been developed to help design team speed up their clock tree generation process. The methodology works by breaking up the clock net into smaller partitions, then inserting clock buffers to drive each portion and lastly, routing the connection from original c...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Asian Network for Scientific Information
2009
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/1011/ http://irep.iium.edu.my/1011/ http://irep.iium.edu.my/1011/ http://irep.iium.edu.my/1011/1/Fast_clock_tree_generation_using_Exact_Zero_Skew_clock_routing_algorithm.pdf |
| Summary: | A Zero Skew clock routing methodology has been developed to help design team speed up their clock tree generation process. The methodology works by breaking up the clock net into smaller partitions, then inserting clock buffers to drive each portion and lastly, routing the connection from original clock source to each newly inserted clock buffers with zero skew. A few Perl scripts and a new visual basic based routing tool have been developed to support the methodology implementation. The routing algorithm used in this tool is based on the Exact Zero Skew Routing Algorithm. The methodology has been tested using a real design database and resulting in a significant improvement in the through put time required to complete the clock tree generation. This improvement is attributed to the ability to generate clock tree on much smaller portions of clock nets that supports of speeding up the clock tree generation process in IC design. |
|---|