https://scholars.lib.ntu.edu.tw/handle/123456789/316492
標題: | A routing algorithm for flip-chip design | 作者: | Fang, J.-W. Lin, I.-J. Yuh, P.-H. Wang, J.-H. YAO-WEN CHANG |
公開日期: | 2005 | 卷: | 2005 | 起(迄)頁: | 752-757 | 來源出版物: | IEEE/ACM International Conference on Computer-Aided Design | 摘要: | The flip-chip package gives the highest chip density of any packaging method to support the pad-limited Application-Specific Integrated Circuit (ASIC) designs. In this paper, we propose the first router for the flip-chip package in the literature. The router can redistribute nets from wire-bonding pads to bump pads and then route each of them. The router adopts a two-stage technique of global routing followed by detailed routing. In global routing, we use the network flow algorithm to solve the assignment problem from the wire-bonding pads to the bump pads, and then create the global routing path for each net. The detailed routing consists of three stages, cross point assignment, net ordering determination, and track assignment, to complete the routing. Experimental results based on seven real designs from the industry demonstrate that the router can reduce the total wirelength by 10.2%, the critical wirelength by 13.4%, and the signal skews by 13.9%, compared with a heuristic algorithm currently used in industry. © 2005 IEEE. |
URI: | http://www.scopus.com/inward/record.url?eid=2-s2.0-33751400036&partnerID=MN8TOARS http://scholars.lib.ntu.edu.tw/handle/123456789/316492 |
ISSN: | 10923152 | DOI: | 10.1109/ICCAD.2005.1560165 | SDG/關鍵字: | Algorithms; Heuristic methods; Problem solving; Routers; Systems analysis; Network flow algorithms; Routing algorithms; Chip scale packages |
顯示於: | 電子工程學研究所 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。