| 一种新的受限通孔最小化算法 |
| |
| 引用本文： | 唐茂林.一种新的受限通孔最小化算法[J].湖北大学学报(自然科学版),1994,16(1):63-68. |
| |
| 作者姓名： | 唐茂林 |
| |
| 摘 要： | 提出一种求解双层ＶＬＳＩ布线的受限通孔最小化问题（ＣｏｎｓｔｒａｉｎｅｄＶｉａＭｉｎｉｍｉｚａｔｉｏｎ）的图论模型；然后，以此为基础提出了一种采用分治策略（ｄｉｖｉｄｅ—ａｎｄ—ｃｏｎｑｕｅｒ）的受限通孔最小化算法。理论分析表明，该算法具有较好的平均性能和较低的计算复杂性。
|
| 关 键 词： | 受限通孔 最小化 集成电路 算法 |
A NEW ALGORITHM FOR CONSTRAINED VIA MINIMIZATION |
| |
| Tang Maolin.A NEW ALGORITHM FOR CONSTRAINED VIA MINIMIZATION[J].Journal of Hubei University(Natural Science Edition),1994,16(1):63-68. |
| |
| Authors: | Tang Maolin |
| |
| Institution: | Computer Science Department |
| |
| Abstract: | In this paper,a new graph-theoretic Constrained Via Minimization(CVM)model for two-layer VLSI routing is presented. And then,on the basis of the model,we proposed a divide-and-conquer algorithm.Theoretic analysis shows that the algorithm has satisfactory performance and lower computing complexity. |
| |
| Keywords: | VLSI CVM Divide-and-conquer Algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
