Constrained via minimization with practical considerations for multi-layer VLSI/PCB routing problems

Sung Chuan Fang*, Kuo En Chang, Wu Shiung Feng, Sao Jie Chen

*此作品的通信作者

研究成果: 書貢獻/報告類型會議論文篇章

9 引文 斯高帕斯(Scopus)

摘要

A segment-crossing graph model is introduced, and a heuristic algorithm is proposed on the basis of this graph model. The algorithm is divided into two steps: Global Minimization and Local Minimization. In addition, practical considerations such as restricted terminals and adjacent limitations are addressed. The algorithm is evaluated by some routing examples using five layers. The results show that 45% of vias minimized are obtained on an average.

原文英語
主出版物標題Proceedings - Design Automation Conference
發行者Publ by IEEE
頁面60-65
頁數6
ISBN(列印)0818691492, 9780818691492
DOIs
出版狀態已發佈 - 1991
事件Proceedings of the 28th ACM/IEEE Design Automation Conference - San Francisco, CA, USA
持續時間: 1991 六月 171991 六月 21

出版系列

名字Proceedings - Design Automation Conference
ISSN(列印)0146-7123

其他

其他Proceedings of the 28th ACM/IEEE Design Automation Conference
城市San Francisco, CA, USA
期間1991/06/171991/06/21

ASJC Scopus subject areas

  • 工程 (全部)

指紋

深入研究「Constrained via minimization with practical considerations for multi-layer VLSI/PCB routing problems」主題。共同形成了獨特的指紋。

引用此