A heuristic single-row router minimizing interstreet crossings

Author

Batalama, Stella N. ; Pados, Dimitris A. ; Papatheodorou, Theodore S.

Author_Institution

Dept. of Electr. Eng., Virgina Univ., Charlottesville, VA, USA

Volume

12

Issue

7

fYear

1993

fDate

7/1/1993 12:00:00 AM

Firstpage

946

Lastpage

955

Abstract

The problem of minimizing the number of interstreet crossings in single-row routing, known to be intractable in the sense of NP-completeness is studied. An efficient heuristic algorithm for solving this problem is presented. The worst-case computational complexity of the algorithm is O(mn+m³), where n is the number of nodes and m⩽n/2 is the number of nets. Some theoretical work regarding lower bounds for the total number of interstreet crossings needed to realize a given netlist is also presented. Examples are given in which the theoretical bounds coincide with the required minimum. Moreover, in several cases, this theoretical minimum is achieved by the present algorithm thus demonstrating its efficiency. Besides it obvious importance in integrated circuits design, such an algorithm can also be useful for implementing channel and switch-box routers which minimize the number of required vias in multilayer printed wiring boards

Keywords

VLSI; computational complexity; network routing; network topology; printed circuit design; NP-completeness; heuristic algorithm; heuristic single-row router; interstreet crossings; multilayer printed wiring boards; switch-box routers; vias; worst-case computational complexity; Computational complexity; Heuristic algorithms; Informatics; Integrated circuit synthesis; Nonhomogeneous media; Pins; Routing; Switching circuits; Wire; Wiring;

fLanguage

English

Journal_Title

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

Publisher

ieee

ISSN

0278-0070

Type

jour

DOI

10.1109/43.238031

Filename

238031