| 書目名稱 | On Optimal Interconnections for VLSI | | 編輯 | Andrew B. Kahng,Gabriel Robins | | 視頻video | http://file.papertrans.cn/702/701042/701042.mp4 | | 叢書名稱 | The Springer International Series in Engineering and Computer Science | | 圖書封面 |  | | 描述 | .On Optimal Interconnections for VLSI. describes, from ageometric perspective, algorithms for high-performance, high-densityinterconnections during the global and detailed routing phases ofcircuit layout. First, the book addresses area minimization, with afocus on near-optimal approximation algorithms for minimum-costSteiner routing. In addition to practical implementations of recentmethods, the implications of recent results on spanning tree degreebounds and the method of Zelikovsky are discussed. Second, the bookaddresses delay minimization, starting with a discussion of accurate,yet algorithmically tractable, delay models. Recent minimum-delayconstructions are highlighted, including provably good cost-radiustradeoffs, critical-sink routing algorithms, Elmore delay-optimalrouting, graph Steiner arborescences, non-tree routing, andwiresizing. Third, the book addresses skew minimization for clockrouting and prescribed-delay routing formulations. The discussionstarts with early matching-based constructions and goes on to treatzero-skew routing with provably minimum wirelength, as well as planarclock routing. Finally, the book concludes with a discussion ofmultiple (competing) object | | 出版日期 | Book 1995 | | 關鍵詞 | FPGA; Field Programmable Gate Array; Phase; Signal; VLSI; algorithms; circuit; circuit design; computer-aide | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4757-2363-2 | | isbn_softcover | 978-1-4419-5145-8 | | isbn_ebook | 978-1-4757-2363-2Series ISSN 0893-3405 | | issn_series | 0893-3405 | | copyright | Springer Science+Business Media New York 1995 |
The information of publication is updating
|
|
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2026-1-18 22:14
發(fā)表于 2025-3-21 18:49:47
