| 一种加载缓冲器的有界偏差平面时钟布线算法 |
| |
| 引用本文： | 马琪,李海军,王利兴.一种加载缓冲器的有界偏差平面时钟布线算法[J].微电子学,2005,35(2):145-148. |
| |
| 作者姓名： | 马琪 李海军 王利兴 |
| |
| 作者单位： | 杭州电子科技大学,微电子CAD研究所,浙江,杭州,310018 |
| |
| 摘 要： | 提出了一种加载缓冲器的有界偏差平面时钟布线方法.该方法由两步组成:第一步,由平面时钟布线生成一个时延相对平衡的平面时钟树;第二步,通过在平面时钟树的适当位置插入缓冲器,得到一个有界时钟偏差的平面时钟树.
|
| 关 键 词： | 平面时钟布线 缓冲器插入 有界偏差 时钟树 |
| 文章编号： | 1004-3365(2005)02-0145-04 |
A Bounded-Skew Planar Clock Routing Algorithm with Buffer Insertion |
| |
| MA Qi,LI Hai-jun,WANG Li-xing.A Bounded-Skew Planar Clock Routing Algorithm with Buffer Insertion[J].Microelectronics,2005,35(2):145-148. |
| |
| Authors: | MA Qi LI Hai-jun WANG Li-xing |
| |
| Abstract: | A bounded-skew planar clock routing algorithm is presented in the paper, which consists of two steps: first, a planar clock router generates a non-delay-balanced clock tree; and then a buffer insertion technique is used to obtain a bounded-skew planar clock tree. The experiment results show that the algorithm is efficient. |
| |
| Keywords: | Planar clock routing Buffer insertion Bounded-skew Clock tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
