« Home « Chủ đề tổng quan chi tiết của VLSI

Chủ đề : tổng quan chi tiết của VLSI


Có 100+ tài liệu thuộc chủ đề "tổng quan chi tiết của VLSI"

Handbook of algorithms for physical design automation part 80

tailieu.vn

The yield ingredient, Y batch can be further classified based on either type of defect or of failure.. The yield loss due to such faults can be predicted by critical area analysis, and this is discussed later in this chapter.. For these circuits, there can be significant performance-limited yield loss, and therefore, they are designed with a large guardband. However,...

Handbook of algorithms for physical design automation part 81

tailieu.vn

Critical Area Integration. L 1 , or octagon metric), where the critical area integral can be computed analytically given the defect size distribution D ( r. Once analytic formulas are established for each type of simple region, the total critical area integral can be derived as a simple summation of those formulas. As a result, critical area extraction becomes trivial...

Handbook of algorithms for physical design automation part 82

tailieu.vn

Manufacturability-aware routing can be accomplished at any stage of routing system if proper manufacturing model is available, and the approaches can be roughly classified into two groups: rule-based and model-based. Then, we compare the pros and cons of the rule-based and model-based approaches in Section 38.3. In practice, both approaches are used where the model-based approach can be used for...

Handbook of algorithms for physical design automation part 83

tailieu.vn

38.5 DEALING WITH MANUFACTURING RULES DURING DETAILED ROUTING. This is a topic with very few publications, but it is often a designer’s nightmare because of the explosion in the number of design rules at the detailed routing level.. As shown in Figure 38.9, for 90 nm and above, the DRC compliance check is triggered usually after the routing for the...

Handbook of algorithms for physical design automation part 84

tailieu.vn

39.1 Introduction. 39.2 Major Phases of Physical Synthesis. 39.3 Optimization and Placement Interaction. 39.3.1 Bin-Based Placement Model. 39.3.2 Exact Placement. 39.4 Critical Path Optimizations. 39.4.1 Gate Sizing. 39.4.2 Gate Sizing with Multiple-vt Libraries. 39.4.3 Incremental Synthesis. 39.4.4 Advanced Synthesis Techniques. 39.4.5 Fixing Early Paths. 39.4.6 Drivers for Multiple Objectives. 39.5 Mechanisms for Recovery. 39.5.1 Area Recovery. 39.5.2 Routing Recovery. 39.5.3...

Handbook of algorithms for physical design automation part 85

tailieu.vn

FIGURE 39.5 Inverter processing.. FIGURE 39.6 Cell expansion.. FIGURE 39.7 Off-path resizing.. C D E FIGURE 39.8 Shattering.. When correcting hold violations (short paths), the off-path cells can be powered up to present higher pin capacitance and slow down a path.. Shattering: Similar to cell expansion, larger fan-in cell can be decomposed into a tree of smaller cells. Figure 39.8...

Handbook of algorithms for physical design automation part 86

tailieu.vn

832 Handbook of Algorithms for Physical Design Automation. Physical synthesis requires a seamless integration of many previously separate design automation domains, such as optimization, placement, timing, extraction, and routing.. Design closure requires that accurate modeling of the clock tree network and routing be incorporated earlier and earlier up the physical synthesis pipeline to take into account their effects on timing...

Handbook of algorithms for physical design automation part 87

tailieu.vn

To exploit the benefits of the partitioning idea within an X system, we use a modified simulated annealing strategy to partition the components into an n × m grid, where n and m are both greater than 1. We refined and improved this approach for n = m = 4 to create the first placer for the X interconnect architecture.....

Handbook of algorithms for physical design automation part 88

tailieu.vn

FIGURE 40.7 (a) Illegal and (b) legal access of wires to vias, (c) illegal and (d) legal pattern for a transition between a wide diagonal and a narrow diagonal wire.. Manufacturers typically require diagonal geometry edges to have a significant minimum length, which leads to a menagerie of illegal patterns that must be avoided during the layout process (Figure 40.14)....

Handbook of algorithms for physical design automation part 89

tailieu.vn

862 Handbook of Algorithms for Physical Design Automation. Wang, A Place: A generic analytical placement framework, Proceedings of the International Symposium on Physical Design, pp. Honda, A maze-running algorithm using fuzzy set theory for routing methods of printed circuit boards, Proceedings of the Ninth IEEE International Conference on Fuzzy Systems, Vol. Zachariasen, An exact algorithm for the uniformly-oriented Steiner tree...

Handbook of algorithms for physical design automation part 90

tailieu.vn

41.4.1 E FFECTS OF I NDUCTANCE ON D ELAY AND S IGNAL R ISE T IME. α asym is the asymptotic value at high frequencies of the attenuation per unit length of the signals as the signals propagate across a lossy transmission line, as shown in Figure 41.4.. For the limiting case where L → 0, Equation 41.8 reduces to...

Handbook of algorithms for physical design automation part 91

tailieu.vn

42.1 METRICS FOR CLOCK NETWORK DESIGN. Unlike other signals that carry data information, the clock signal in edge-triggered circuits carry timing information by the signal transitions (i.e., edges). 42.1.1 S KEW. The clock skew between two points i and j on a chip is defined as t i − t j , where t i and t j are the...

Handbook of algorithms for physical design automation part 92

tailieu.vn

FF i and FF j as shown in Figure 42.11. Let t i and t j be the clock delays from clock source to FF i and FF j , respectively. Let t i clk2q be the clock-to-Q delay for FF i . Let P be the clock period. A clock schedule is a set of delays from clock source...

Handbook of algorithms for physical design automation part 93

tailieu.vn

FIGURE 43.5 Alpha 21264 clock hierarchy. FIGURE 43.6 Global clock distribution network of Alpha 21264. The GCLK grid is shown in Figure 43.7.. The major clock grids are shown in Figure 43.8. Because of the wide variation of clock loads, the grid density varies widely between major clocks, and sometimes even for a single major clock. Major clocks driven by...

Handbook of algorithms for physical design automation part 94

tailieu.vn

The clock distribution of the Power4 microprocessor. The circuit and physical design of the POWER4 microprocessor. The design and analysis of the clock distribution network for a 1.2 GHz Alpha microprocessor. The implementation of the Itanium 2 microprocessor. 44 Power Grid Design. 44.1 Motivation. 44.1.1 Technology Trends and Challenges. 44.1.2 Overview of the Chapter. 44.2 Modeling and Analysis Methodology. 44.2.1...

Handbook of algorithms for physical design automation part 95

tailieu.vn

44.3 POWER GRID NOISE ANALYSIS 44.3.1 N OISE M ETRICS. For static (DC) analysis, the maximum voltage drop among all power grid nodes is a general metric for the entire chip. The maximum voltage drop among all nodes in the power grid circuit can indicate performance of the power grid and help identify hot spots on a chip. This measurement...

Handbook of algorithms for physical design automation part 96

tailieu.vn

The earliest power/ground network sizing work [5,6] takes special advantage of the tree topology of the power/ground network typically used in early designs. Instead of restricting the voltage drop on every node in the P/G network, only the voltage drop from root to every leaf of the tree structure is constrained, where the root corresponds chip power pad and the...

Handbook of algorithms for physical design automation part 97

tailieu.vn

Section 45.2 describes several programming technologies, Section 45.3 describes logic block architectures, Section 45.4 describes routing architectures, and Sections 45.5 and 45.6 describe embedded memories and embedded computation blocks.. 45.2 PROGRAMMING TECHNOLOGIES. These bits can be constructed in various ways. Table 45.1 provides a comparison among these three technologies. 45.2.1 SRAM - B ASED FPGA S. In addition, SRAM bits...

Handbook of algorithms for physical design automation part 98

tailieu.vn

The flexibility of the connection block, F m , can be defined as the number of programmable connections available between each horizontal pin and the adjacent vertical channel. Their outputs can be synchronous through the use of the LUTs associated register. Field-Programmable Gate Array Architectures 953. Instead they develop two mixed-grain logic blocks that are suitable for implementing both arithmetic...

Handbook of algorithms for physical design automation part 99

tailieu.vn

FIGURE 46.4 Multilevel clustering and placement. and Rose, J., Proceedings of the ACM/SIGDA International Symposium on Field Programmable Gate Arrays . With permission.) The flow maintains a list of clusters of macros, and a set of buckets that correspond to regions on the FPGA that have to house one cluster each. The buckets are all of the same shape, but...