The layer assignment problem for VLSI routing is the problem of determining which layers can be used for routing the wire segments in the interconnections of nets so that the number of vias is minimized. In this paper, we first transform the problem of layer assignment for multi-layer routing to the graph contractability problem and then a heuristic algorithm is proposed on the basis of the graph contractability model. The algorithm was evaluated using Deustch’s five-layer difficult example. The result showed that the number of vias is reduced 38.5 percent.
|Number of pages||10|
|Journal||Journal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers,Series A/Chung-kuo Kung Ch'eng Hsuch K'an|
|Publication status||Published - 1991 Jan 1|
- Graph contractability
- Layer assignment
- Via minimization
ASJC Scopus subject areas