找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: VLSI Physical Design: From Graph Partitioning to Timing Closure; Andrew B. Kahng,Jens Lienig,Jin Hu Textbook 20222nd edition The Editor(s)

[復制鏈接]
樓主: 門牙
31#
發(fā)表于 2025-3-26 23:01:58 | 只看該作者
32#
發(fā)表于 2025-3-27 03:21:34 | 只看該作者
Chip Planning,s. .–.) determines the locations and dimensions of the shapes that are the result of partitioning the entire circuit (Chap. .). Hence, floorplanning produces assigned blocks and enables early estimates of interconnect length, circuit delay, and chip performance. Pin assignment (Sect. .) assigns outg
33#
發(fā)表于 2025-3-27 08:27:01 | 只看該作者
Global and Detailed Placement, pin locations (Chap. .), placement seeks to determine the locations of (standard) cells or logic elements within each block. Placement is subject to multiple optimization objectives, a common one being the minimization of the total length of connections between elements. Global placement (Sect. .)
34#
發(fā)表于 2025-3-27 11:59:58 | 只看該作者
Global Routing,ng first partitions the chip into routing regions and searches for region-to-region paths for all signal nets; this is followed by detailed routing, which determines the exact tracks and vias of these nets based on their region assignments (Chap. .). During global routing, pins with the same electri
35#
發(fā)表于 2025-3-27 17:33:22 | 只看該作者
Detailed Routing,c routing tracks, vias, and metal layers in a manner consistent with given global routes of those nets. Traditional detailed routing techniques are applied within routing regions, such as channels (Sect. .) and switch boxes (Sect. .). For modern designs, over-the-cell (OTC) or gcell routing (Sect. .
36#
發(fā)表于 2025-3-27 19:21:14 | 只看該作者
37#
發(fā)表于 2025-3-28 01:54:44 | 只看該作者
38#
發(fā)表于 2025-3-28 05:33:28 | 只看該作者
Appendix,hieved in terms of schedule and quality of results, as demonstrated in recent publications (Sect. .). This first part of the appendix identifies a number of useful surveys and reviews ML-based methods that can be applied to tasks addressed in the preceding chapters of the book. Section 9.2 presents
39#
發(fā)表于 2025-3-28 06:50:39 | 只看該作者
Textbook 20222nd editionis software needs a?high-level understanding of the underlying mathematical models and algorithms. In?addition, a developer of such software must have a keen understanding of relevant computer?science aspects, including algorithmic performance bottlenecks and how various?algorithms operate and inter
40#
發(fā)表于 2025-3-28 13:34:40 | 只看該作者
Netlist and System Partitioning,ts. .–.) can handle large netlists and can redefine a physical hierarchy of an electronic system, ranging from boards to chips, and from chips to blocks. Traditional netlist partitioning can be extended to multilevel partitioning (Sect. .), which can be used to handle large-scale circuits and systems.
 關于派博傳思  派博傳思旗下網站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網 吾愛論文網 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經驗總結 SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網安備110108008328) GMT+8, 2025-10-5 01:18
Copyright © 2001-2015 派博傳思   京公網安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
佳木斯市| 呼伦贝尔市| 榆林市| 高州市| 冷水江市| 绍兴市| 大姚县| 淮南市| 怀化市| 潜山县| 北碚区| 宝清县| 临洮县| 德州市| 麻阳| 绩溪县| 洛川县| 东港市| 牟定县| 太仆寺旗| 繁峙县| 确山县| 乌鲁木齐县| 界首市| 大邑县| 永靖县| 精河县| 河西区| 松原市| 太康县| 遂溪县| 雅江县| 玉门市| 北宁市| 晋城| 彩票| 太白县| 达孜县| 金昌市| 尖扎县| 治多县|