Title :
Minimum-Via Topological Routing
Author_Institution :
Department of Electrical Engineering and Computer Science and the Electronics Research Laboratory, University of California, Berkeley, CA, USA
fDate :
10/1/1983 12:00:00 AM
Abstract :
A new approach to the two-dimensional routing utilizing two layers is proposed. It consists of two major steps, topological routing and geometrical mapping. This paper describes the topological routing algorithm in detail. Based on a circle graph representation of the net intersection information of the routing problem, a maximal set of nets that can be routed without vias are selected. The layer assignments for the selected nets are determined by a global analysis so that the total number of vias needed is minimum. The layer assignment problem turns out to be a maximum-cut problem on an edge-weighted graph and we developed a greedy algorithm for it. According to the layer assignments, the detailed topological routes are then generated.
Keywords :
Aerospace electronics; Aircraft propulsion; Greedy algorithms; Helium; Integrated circuit yield; Routing; Terminology; Wires;
Journal_Title :
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
DOI :
10.1109/TCAD.1983.1270041
