论文信息 - A near-optimum parallel algorithm for one-dimensional gate assignment problems

A near-optimum parallel algorithm for one-dimensional gate assignment problems

A near-optimum parallel algorithm for one-dimensional gate assignment problems is presented in this paper where the problem is NP-hard. The proposed system is composed of an nn two-dimensional maximum neural network for (n+2)-gate assignment problems. Our algorithm has discovered the improved solution in the benchmark problem over the existing algorithms.

Yoshiyasu Takefuji | Kazuhiro Tsuchiya | K. Tsuchiya | Yoshiyasu Takefuji

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

[2] A. Weinberger. Large Scale Integration of MOS Complex Logic: A Layout Method , 1967 .

[3] Kyu Ho Park,et al. A heuristic algorithm for ordering the columns in one-dimensional logica arrays , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4] A. Hashimoto,et al. Wire routing by optimizing channel assignment within large apertures , 1971, DAC '71.

[5] Tamotsu Kasai,et al. A hierarchical algorithm for one-dimensional gate assignment based on contraction of nets , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6] Yoshiyasu Takefuji,et al. A generalized maximum neural network for the module orientation problem , 1992 .