论文部分内容阅读
本文在布线的相交图模型基础上,利用离散型的Hopfield网络解决了相交图的最大切割问题,从而解决了双层布线的分层及通孔最少化问题。新算法考虑了许多来自实际问题的约束,并对大量的布线实例进行了验证。
In this paper, based on the intersection graph model of wiring, the discrete Hopfield network is used to solve the maximum cutting problem of the intersection graph, which solves the problem of layering and vias minimization of double-layer wiring. The new algorithm takes into account many constraints from practical problems and validates a large number of cabling examples.