| 一个基于Hopfield神经网络的双层布线通孔最少化算法 |
| |
| 引用本文： | 马琪,严晓浪.一个基于Hopfield神经网络的双层布线通孔最少化算法[J].电路与系统学报,1998,3(3):59-64. |
| |
| 作者姓名： | 马琪 严晓浪 |
| |
| 作者单位： | 杭州大学电子工程系，杭州电子工业学院ＣＡＤ所 |
| |
| 摘 要： | 本文在布线的群图模型基础上，利用离散型Ｈｏｐｆｉｅｌｄ神经网络解决群图的最大割问题，并着重论述了如何跳出局部优化点的问题，从而较好地解决了双层布线通孔最少化问题，算法考虑了许多来自实际的约束，并进行大量的布线实例验证。
|
| 关 键 词： | VLSI 通孔最少化 最大割 神经网络 详细布线 |
A Hopfield Neural Network Approach to Two-layer Constrained Via Minimization |
| |
| Ma,Qi.A Hopfield Neural Network Approach to Two-layer Constrained Via Minimization[J].Journal of Circuits and Systems,1998,3(3):59-64. |
| |
| Authors: | Ma Qi |
| |
| Abstract: | The constrained via minimization problem in VLSI/PCB routing is to determine which layers can be used for routing the wire segments such that the number of vias can be minimized.In this paper,we present a new approach for two-layer via minimization by means of discrete Hopfield neural network on the basis of weighted cluster graph model.In addition,many physical constraints are taken into consideration here.The results of experinments indicate that our algorithm is very efficient and encouraging. |
| |
| Keywords: | VLSI Constrained Via Minimization Max-cut Neural Network Detailed Routing |
| 本文献已被 CNKI 维普 等数据库收录！ |
