DocumentCode
852429
Title
Layer assignment problem for three-layer routing
Author
Chang, K.C. ; Du, H.C.
Author_Institution
Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA
Volume
37
Issue
5
fYear
1988
fDate
5/1/1988 12:00:00 AM
Firstpage
625
Lastpage
632
Abstract
The layer assignment problem for interconnect is the problem of determining which layers should be used for wiring the signal nets so that the number of vias is minimized. The problem is often referred to as the via minimization problem. The problem is considered for three-layer routing, concentrating on one version called the constrained via minimization (CVM3) problem. It is shown that the CVM3 problem is NP-complete and a heuristic algorithm is proposed. The experimental results show that the proposed algorithm is efficient and generates fairly good solutions
Keywords
VLSI; circuit layout CAD; computational complexity; heuristic programming; minimisation; CVM3; NP-complete; constrained via minimization; heuristic algorithm; layer assignment; signal nets; three-layer routing; Computer science; Heuristic algorithms; Integrated circuit interconnections; Large scale integration; Minimization; Routing; Topology; Very large scale integration; Wire; Wiring;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.4616
Filename
4616
Link To Document