Elsevier

Computer-Aided Design

Volume 23, Issue 8, October 1991, Pages 539-547
Computer-Aided Design

Neural computation network for global routing

https://doi.org/10.1016/0010-4485(91)90054-ZGet rights and content

Abstract

Global routing is a crucial step in circuit layout. Under the constraint of the relative positions of circuit blocks enforced by placement, the global routing develops an effective plan such that the interconnections of nets can be completed efficiently. This problem has been proven to be NP-complete, and most of the currently available algorithms are heuristic. The paper proposes a new neural-computation-network architecture based on the Hopfield and Tank model for the global-routing problem. This network is constructed using two layers of neurons. One layer is used for minimizing the total path length and distributing interconnecting wires evenly between channels. The other layer is used for channel-capacity enforcement. This network is proven to be able to converge to a stable state. A set of randomly generated testing examples are used to verify the performance of the approach. A reduction in total path length of about 20% is attained by this network.

References (17)

  • M. Garey et al.

    Computers and Intractability: A Guide to the Theory of NP-Completeness

    (1979)
  • M.P. Vecchi et al.

    Global wiring by simulated annealing

    IEEE Trans. Comput.-Aided Des.

    (1983)
  • C. Sechen

    VLSI Placement and Global Routing Using Simulated Annealing

    (1988)
  • E.S. Kuh et al.

    Global routing

  • R.M. Karp et al.

    Global wire routing in two dimensional arrays

  • R. Libeskind-Hadas et al.

    Solutions to the module orientation and rotation problems by neural computation networks

  • J.S. Yih et al.

    A neural network design for circuit partitioning

  • C. Mead

    Analog VLSI and Neural Systems

    (1989)
There are more references available in the full text version of this article.

Cited by (0)

View full text