A neural network model for multilayer topological via minimization in a switchbox

This paper presents a new approach using a neural network model for the multilayer topological via minimization problem in a switchbox. Our algorithm consists of three steps: 1) dividing multiterminal nets into two-terminal nets, 2) finding a layer-assignment of the two-terminal nets by a neural network model so as to minimize the number of unassigned nets, and 3) embedding one via for each unassigned net by Marek-Sadowska's algorithm. The neural network model is composed of N/spl times/M processing elements to assign N two-terminal nets in an M-layer switchbox. The performance of our algorithm is verified by 15 benchmark problems where it can find optimum or near-optimum solutions. In the two-layer Burstein's switchbox, our algorithm finds a 15-via solution while the best known solution requires 20 vias.

[1]  W. Pitts,et al.  A Logical Calculus of the Ideas Immanent in Nervous Activity (1943) , 2021, Ideas That Created the Future.

[2]  John J. Hopfield,et al.  Simple 'neural' optimization networks: An A/D converter, signal decision circuit, and a linear programming circuit , 1986 .

[3]  Wentai Liu,et al.  Unconstrained via minimization for topological multilayer routing , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Yoshiyasu Takefuji,et al.  Neural network parallel computing , 1992, The Kluwer international series in engineering and computer science.

[5]  Yoshiyasu Takefuji,et al.  A neural network approach to topological via-minimization problems , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  KENNETH J. SUPOWIT,et al.  Finding a Maximum Planar Subset of a Set of Nets in a Channel , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[7]  Majid Sarrafzadeh,et al.  A new approach to topological via minimization , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Michael Burstein,et al.  Hierarchical Wire Routing , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  David Hung-Chang Du,et al.  Efficient Algorithms for Layer Assignment Problem , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[10]  Chi-Ping Hsu.  Minimum-Via Topological Routing , 1983, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Majid Sarrafzadeh,et al.  Topological Via Minimization Revisited , 1991, IEEE Trans. Computers.

[12]  Anne-Marie Tagant,et al.  A general and flexible switchbox router: CARIOCA , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Akihiro Hashimoto,et al.  Wire routing by optimizing channel assignment within large apertures , 1971, DAC.

[14]  Yoji Kajitani,et al.  A graph- theoretic via minimization algorithm for two layer printed circuit boards , 1983 .

[15]  Takakazu Kurokawa,et al.  Bus connected neural network hardware system , 1994 .

[16]  Toshinobu Kashiwabara,et al.  Exact algorithms for multilayer topological via minimization , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  Malgorzata Marek-Sadowska.  An Unconstrained Topological Via Minimization Problem for Two-Layer Routing , 1984, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[18]  Jason Cong,et al.  On the k-layer planar subset and topological via minimization problems , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..