Titlebook: Algorithms for VLSI Physical Design Automation; Naveed A. Sherwani Book 1993 Springer Science+Business Media New York 1993 Phase.VLSI.auto

變更

書(shū)目名稱Algorithms for VLSI Physical Design Automation影響因子(影響力)




書(shū)目名稱Algorithms for VLSI Physical Design Automation影響因子(影響力)學(xué)科排名




書(shū)目名稱Algorithms for VLSI Physical Design Automation網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Algorithms for VLSI Physical Design Automation網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Algorithms for VLSI Physical Design Automation被引頻次




書(shū)目名稱Algorithms for VLSI Physical Design Automation被引頻次學(xué)科排名




書(shū)目名稱Algorithms for VLSI Physical Design Automation年度引用




書(shū)目名稱Algorithms for VLSI Physical Design Automation年度引用學(xué)科排名




書(shū)目名稱Algorithms for VLSI Physical Design Automation讀者反饋




書(shū)目名稱Algorithms for VLSI Physical Design Automation讀者反饋學(xué)科排名

dilute

Design and Fabrication of VLSI Devices, specified for proper fabrication. A . is a specification of geometric shapes that need to be created on a certain layer. Several masks must be created, one for each layer. The actual fabrication process starts with the creation of a silicon wafer by crystal growth. The wafer is then processed for s

啤酒

Data Structures and Basic Algorithms,(vertical and horizontal edges) and are not allowed to overlap within the same layer. The layouts have historically been manipulated by human layout designers to conform to the design rules and perform the specified functions. These manipulations were time consuming and error prone, even for small l

知道

Partitioning,. After the decomposition, each subsystem can be designed independently and simultaneously to speed up the design process. A system must be decomposed carefully so that the original functionality of the system is maintained. During the decomposition, an interface specification is generated which is

地殼

Global Routing,connections. Space not occupied by the blocks can be viewed as a collection of regions. These regions are used for routing and are called as .. The process of finding the geometric layouts of all the nets is called .. Each routing region has a capacity, which is the maximum number of nets that can p

率直

Detailed Routing,h a subset of the routing regions, connecting the terminals of each net. Global routers do not define the wires, instead, they use the original net information and define a set of restricted routing problems. The detailed router places the actual wire segments within the region indicated by the glob

explicit

Via Minimization and Over-the-Cell Routing,uce the possibility of fabrication errors, reduce the total chip area and therefore, improve performance. In this chapter, we will discuss two methods of improving detailed routing: via minimization and over-the-cell routing.

Perineum

Specialized Routing, proportional to clock frequency. Clock nets need to be routed with great precision, since the actual length of the path of a net from its entry point to its terminals determines the maximum clock frequency on which a chip may operate. A clock router needs to take several factors into account, inclu

突變

GOUGE

Physical Design Automation of FPGAs,fabrication of chips, and therefore there is a need to find new technologies, which minimize the fabrication time. Gate Arrays use less time in fabrication as compared to full—custom chips, since only routing layers are fabricated on top of pre—fabricated wafer. However, fabrication time for gate—ar