|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Yang Yang, Tong Jing, Xianlong Hong, Yu Hu, Qi Zhu, Xiaodong Hu, Guiying Yan, "Via-Aware Global Routing for Good VLSI Manufacturability and High Yield," 2012 IEEE 23rd International Conference on Application-Specific Systems, Architectures and Processors, pp. 198-203, 2005 IEEE International Conference on Application-Specific Systems, Architecture Processors (ASAP'05), 2005. | |||
| BibTex | x | ||
| @article{ 10.1109/ASAP.2005.67, author = {Yang Yang and Tong Jing and Xianlong Hong and Yu Hu and Qi Zhu and Xiaodong Hu and Guiying Yan}, title = {Via-Aware Global Routing for Good VLSI Manufacturability and High Yield}, journal ={2012 IEEE 23rd International Conference on Application-Specific Systems, Architectures and Processors}, volume = {0}, year = {2005}, issn = {1063-6862}, pages = {198-203}, doi = {http://doi.ieeecomputersociety.org/10.1109/ASAP.2005.67}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 IEEE 23rd International Conference on Application-Specific Systems, Architectures and Processors TI - Via-Aware Global Routing for Good VLSI Manufacturability and High Yield SN - 1063-6862 SP198 EP203 A1 - Yang Yang, A1 - Tong Jing, A1 - Xianlong Hong, A1 - Yu Hu, A1 - Qi Zhu, A1 - Xiaodong Hu, A1 - Guiying Yan, PY - 2005 KW - null VL - 0 JA - 2012 IEEE 23rd International Conference on Application-Specific Systems, Architectures and Processors ER - | |||
CAD tools have become more and more important for integrated circuit (IC) design since a complicated system can be designed into a single chip, called system-on-a-chip (SOC), in which physical design tool is an essential and critical part. We try to consider the via minimization problem as early as possible in physical design. We propose a routing method focusing on minimizing vias while considering routability and wire-length constraint. That is, in the global routing phase, we minimize the number of bends, which is closely related to the number of vias. Previous work only dealt with very small nets, but our algorithm is general for the nets with any size. Experimental results show that our algorithm can greatly reduce the count of bends for various sizes of nets while meeting the constraints of congestion and wire-length.
