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.
|頁（從 - 到）||1632-1635|
|期刊||Proceedings - IEEE International Symposium on Circuits and Systems|
|出版狀態||已發佈 - 1990 十二月 1|
|事件||1990 IEEE International Symposium on Circuits and Systems Part 3 (of 4) - New Orleans, LA, USA|
持續時間: 1990 五月 1 → 1990 五月 3
ASJC Scopus subject areas