| A buffer insertion and simultaneous sizing timing optimization algorithm |
| |
| 作者姓名： | 尹国丽 Lin Zhenghui |
| |
| 作者单位： | Department of Electronic Engineering, Shanghai Jiaotong University, Shanghai 200030, P.R. China |
| |
| 基金项目： | 国家高技术研究发展计划(863计划) |
| |
| 摘 要： | A path-based timing optimization algorithm for buffer insertion and simultaneous sizing is proposed. Firstly, candidate buffer insertion location and buffer size for each branch in a given routing path were obtained via localized timing optimization. Then, through evaluating each potential insertion against design objectives, potential optimal buffer insertion locations and sizes for the whole routing tree were determined. At last, by removing redundant buffer insertion operations which do not maximize S （ so ）, given timing requirements are finally fulfilled through minimum number of buffers.
|
| 关 键 词： | 缓冲器插入 缓冲区大小 适时优化 二进制树形网络 点震源 |
| 收稿时间： | 2005-03-09 |
A buffer insertion and simultaneous sizing timing optimization algorithm |
| |
| Yin Guoli,Lin Zhenghui.A buffer insertion and simultaneous sizing timing optimization algorithm[J].High Technology Letters,2006,12(3):267-271. |
| |
| Authors: | Yin Guoli Lin Zhenghui |
| |
| Abstract: | A path-based timing optimization algorithm for buffer insertion and simultaneous sizing is proposed.Firstly, candidate buffer insertion location and buffer size for each branch in a given routing path were obtained via localized timing optimization. Then, through evaluating each potential insertion against design objectives, potential optimal buffer insertion locations and sizes for the whole routing tree were determined. At last, by removing redundant buffer insertion operations which do not maximize S ( so ), given timing requirements are finally fulfilled through minimum number of buffers. |
| |
| Keywords: | buffer insertion buffer sizing timing optimization binary tree single source |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
