首页 | 本学科首页   官方微博 | 高级检索  
     

一种基于结群的零偏差时钟布线算法
引用本文:刘毅,赵萌,洪先龙,蔡懿慈.一种基于结群的零偏差时钟布线算法[J].计算机辅助设计与图形学学报,2002,14(2):97-100.
作者姓名:刘毅  赵萌  洪先龙  蔡懿慈
作者单位:清华大学计算机科学与技术系,北京,100084
基金项目:国家“九七三”重点基础研究发展规划 ( G19980 30 411),国家自然科学基金 ( 6 0 0 76 0 16 ),高等学校骨干教师支持计划 ( G-1998)资助
摘    要:介绍了一种基于结群的零偏差时钟布线算法,该算法采用新的单元匹配策略,递归地把时钟节点划分成2个负载和半径比较均衡的子集,结合缓冲器的适当插入,产生一棵零偏差的时钟布线树。实验表明,结群处理对处理规模较大的电路快速有效,时钟延迟得到了明显减少。

关 键 词:结群  缓冲器插入  时钟布线算法  同步数字电路  设计

A Clustering-Based Algorithm for Zero-Skew Clock Routing with Buffer Insertion
Liu Yi,Zhao Meng,Hong Xianlong,Cai Yici.A Clustering-Based Algorithm for Zero-Skew Clock Routing with Buffer Insertion[J].Journal of Computer-Aided Design & Computer Graphics,2002,14(2):97-100.
Authors:Liu Yi  Zhao Meng  Hong Xianlong  Cai Yici
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.
Keywords:clock routing  cluster  buffer insertion  zero skew
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号