Via minimization with associated constraints in three-layer routing problem
Resource
Circuits and Systems, 1990., IEEE International Symposium on
Journal
Circuits and Systems, 1990., IEEE International Symposium on
Pages
-
Date Issued
1990-05
Date
1990-05
Author(s)
Fang, Sung-Chuan
Chang, Kuo-En
Feng, Wu-Shiung
DOI
N/A
Abstract
Via minimization is the same as the layer assignment problem in VLSI or PCB routing. It consists of determining which layers can be used for routing the wire segments such that the number of vias can be minimized. A heuristic algorithm is presented to globally eliminate the vias in the three-layer channel routing. Some associated constraints, such as restricted terminals and adjacent limitation, are addressed extensively. According to the results, the algorithm is fast and efficient, thus generating very good results.>
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
00112450.pdf
Size
415.61 KB
Format
Adobe PDF
Checksum
(MD5):905f1ab3d0ade8bc2a6d75885b0bb706