高级检索

一种基于结群的零偏差时钟布线算法

A Clustering-Based Algorithm for Zero-Skew Clock Routing with Buffer Insertion

  • 摘要: 介绍了一种基于结群的零偏差时钟布线算法.该算法采用新的单元匹配策略,递归地把时钟节点划分成2个负载和半径比较均衡的子集,结合缓冲器的适当插入,产生一棵零偏差的时钟布线树.实验表明,结群处理对处理规模较大的电路快速有效,时钟延迟得到了明显减少.

     

    Abstract: Clock routing plays an important role in layout design for synchronous circuit. A zero-skew clock routing algorithm with fast clustering and performance improvement is proposed. During clock routing tree construction, we introduce a new cell matching strategy to merge two sub-trees. Proper buffers are selected and inserted into the clock routing tree, reducing path delay and achieving zero-skew. Clustering method has accelerated the speed of algorithm significantly.

     

/

返回文章
返回