Binary neural network approach for net assignment problems

Nobuo Funabiki, Seishi Nishikawa, Shigeto Tajima

Research output: Contribution to conferencePaper

Abstract

This paper presents a binary neural network approach for the net assignment problem in the over-the-cell routing model in VLSI layout design. The goal of the problem for one cell row and two adjacent channels is to assign a subset of nets in the cell row such that the total channel density is minimized without violating the capacity constraint, the selection constraint, and the routing constraint. The neural network is composed of NM binary neurons for the N-net-M-track problem. Unlike the existing algorithm, our neural network finds an assignment of all the nets either in the cell row or in two channels simultaneously. The performance is verified through simulations in seven benchmark problems for channel routing. With the help of four heuristic methods, the neural network can find near-optimum solutions on the synchronous parallel computation.

Original languageEnglish
Pages2188-2193
Number of pages6
Publication statusPublished - Jan 1 1996
EventProceedings of the 1996 IEEE International Conference on Neural Networks, ICNN. Part 1 (of 4) - Washington, DC, USA
Duration: Jun 3 1996Jun 6 1996

Other

OtherProceedings of the 1996 IEEE International Conference on Neural Networks, ICNN. Part 1 (of 4)
CityWashington, DC, USA
Period6/3/966/6/96

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Binary neural network approach for net assignment problems'. Together they form a unique fingerprint.

  • Cite this

    Funabiki, N., Nishikawa, S., & Tajima, S. (1996). Binary neural network approach for net assignment problems. 2188-2193. Paper presented at Proceedings of the 1996 IEEE International Conference on Neural Networks, ICNN. Part 1 (of 4), Washington, DC, USA, .