完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Huang, Pei-Yu | en_US |
dc.contributor.author | Lee, Yu-Min | en_US |
dc.contributor.author | Tsai, Jeng-Liang | en_US |
dc.contributor.author | Chen, Charlie Chung-Ping | en_US |
dc.date.accessioned | 2014-12-08T15:24:49Z | - |
dc.date.available | 2014-12-08T15:24:49Z | - |
dc.date.issued | 2006 | en_US |
dc.identifier.isbn | 978-0-7803-9389-9 | en_US |
dc.identifier.issn | 0271-4302 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/17257 | - |
dc.description.abstract | The soaring clocking frequency and integration density demand robust and stable power delivery to support tens of millions of transistor switching. In this paper, we consider the problem of minimizing I he area of wires and decoupling capacitors (decaps) for a power delivery network, subject to the limit on integral of voltage drops. First, we derive the gradients of constraint function without Tellegen's theorem. This greatly simplifies the discuss of adjoint sensitivity analysis. Then, we apply the IEKS method to speed up the sensitivity analysis over 3 times. Finally, this efficient analyzer is incorporated with the state-of-the-art nonlinear programming package, SNOPT, to perform the optimization. Extensive experimental results show that the proposed method can work efficiently for large power delivery networks. | en_US |
dc.language.iso | en_US | en_US |
dc.title | Simultaneous area minimization and decaps insertion for power delivery network using adjoint sensitivity analysis with IEKS method | en_US |
dc.type | Proceedings Paper | en_US |
dc.identifier.journal | 2006 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-11, PROCEEDINGS | en_US |
dc.citation.spage | 1291 | en_US |
dc.citation.epage | 1294 | en_US |
dc.contributor.department | 電信工程研究所 | zh_TW |
dc.contributor.department | Institute of Communications Engineering | en_US |
dc.identifier.wosnumber | WOS:000245413501192 | - |
顯示於類別: | 會議論文 |