| 实用版图压缩算法 |
| |
| 引用本文： | 邵建华,方佳估.实用版图压缩算法[J].微电子学,1992,22(1):41-45. |
| |
| 作者姓名： | 邵建华 方佳估 |
| |
| 作者单位： | 复旦大学电子工程系ICCAD室，复旦大学电子工程系ICCAD室，复旦大学电子工程系ICCAD室，复旦大学电子工程系ICCAD室 上海 200433，上海 200433，上海 200433，上海 200433 |
| |
| 摘 要： | 本文给出了两种基于约束图的一维版图压缩算法,即完全约束图压缩算法和精简约束图压缩算法,并对两个算法的性能做了讨论;针对版图中较常用的曼哈顿多边形图形,文中还给出了相应的解决办法。
|
| 关 键 词： | 版图压缩 压缩算法 集成电路 |
A Practical Layout Compaction Algorithm |
| |
| Shao Jianhua,Fang Jiaji,Zhang Kaihe and Tang Pushan Dept. Electronic Engineer. Fudan University,Shanghai.A Practical Layout Compaction Algorithm[J].Microelectronics,1992,22(1):41-45. |
| |
| Authors: | Shao Jianhua Fang Jiaji Zhang Kaihe and Tang Pushan Dept Electronic Engineer Fudan University Shanghai |
| |
| Affiliation: | Shao Jianhua,Fang Jiaji,Zhang Kaihe and Tang Pushan Dept. Electronic Engineer. Fudan University,200433,Shanghai |
| |
| Abstract: | Two algorithms for one-dimensional layout compaction based on constraint graph, i.e. the compaction algorithms of complete constraint graph and reduced constraint graph,are given and their performances are discussed. Solutions to the Manhattan polygon pattern commonly used in the layout are also presented. |
| |
| Keywords: | IC CAD Layout compaction Compaction algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
