<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css"> Skip to main content

Routability-Driven Bump Assignment for Chip-Package Co-Design

dc.citation.epage524en_US
dc.citation.spage519en_US
dc.citation.woscount0en_US
dc.contributor.authorChen, Meng-Lingen_US
dc.contributor.authorTsai, Tu-Hsiungen_US
dc.contributor.authorChen, Hung-Mingen_US
dc.contributor.authorChen, Shi-Haoen_US
dc.contributor.department電子工程學系及電子研究所zh_TW
dc.contributor.departmentDepartment of Electronics Engineering and Institute of Electronicsen_US
dc.date.accessioned2015-07-21T08:30:53Z
dc.date.available2015-07-21T08:30:53Z
dc.date.issued2014-01-01en_US
dc.description.abstractIn current chip and package designs, it is a bottleneck to simultaneously optimize both pin assignment and pin routing for different design domains (chip, package, and board). Usually the whole process costs a huge manual effort and multiple iterations thus reducing profit margin. Therefore, we propose a fast heuristic chip-package co-design algorithm in order to automatically obtain a bump assignment which introduces high routability both in RDL routing and substrate routing (100% in our real case). Experimental results show that the proposed method (inspired by board escape routing algorithms) automatically finishes bump assignment, RDL routing and substrate routing in a short time, while the traditional co-design flow requires weeks even months.en_US
dc.identifier.isbn978-1-4799-2816-3en_US
dc.identifier.issn2153-6961en_US
dc.identifier.journal2014 19TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE (ASP-DAC)en_US
dc.identifier.urihttps://ir.lib.nycu.edu.tw/handle/11536/125047
dc.identifier.wosnumberWOS:000350791700095en_US
dc.language.isoen_USen_US
dc.titleRoutability-Driven Bump Assignment for Chip-Package Co-Designen_US
dc.typeProceedings Paperen_US

Files

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description: