Via minimization with associated constraints in three-layer routing problem

Sung Chuan Fang*, Kuo En Chang, Wu Shiung Feng

*此作品的通信作者

研究成果: 雜誌貢獻會議論文同行評審

5 引文 斯高帕斯(Scopus)

摘要

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
頁數4
期刊Proceedings - IEEE International Symposium on Circuits and Systems
2
出版狀態已發佈 - 1990
對外發佈
事件1990 IEEE International Symposium on Circuits and Systems Part 3 (of 4) - New Orleans, LA, USA
持續時間: 1990 5月 11990 5月 3

ASJC Scopus subject areas

  • 電氣與電子工程

指紋

深入研究「Via minimization with associated constraints in three-layer routing problem」主題。共同形成了獨特的指紋。

引用此