Presentation is loading. Please wait.

Presentation is loading. Please wait.

ECE260B – CSE241A Winter 2005 Introduction and ASIC Flow

Similar presentations


Presentation on theme: "ECE260B – CSE241A Winter 2005 Introduction and ASIC Flow"— Presentation transcript:

1 ECE260B – CSE241A Winter 2005 Introduction and ASIC Flow
Instructor: Bao Liu Website: Slides courtesy of Prof. Andrew B. Kahng

2 Why not a Silicon Compiler?
Ideal Reality Silicon Compiler Design methodology Simple Complex No human interaction Lots of human interaction Spec/Matlab/VHDL ? synthesis placement verification routing Circuit on Silicon

3 Teams in a Design Process
VLSI designers CAD developers Process people Testing team VLSI designers Spec/Matlab/VHDL CAD developers ? synthesis placement verification routing Testing team Circuit on Silicon Process people

4 Class Objectives Learn about ASIC implementation flow: VerilogGDSII
Semi-custom implementation of CMOS digital circuits, and optimization with respect to different constraints: area, speed, power, reliability, cost Understand impact of constraints, tradeoffs, technology scaling Get some feel for each phase of the implementation flow Learn about building blocks: wires, gates, memories Prepare for future design experiences Get some feel for industry-standard design tools, libraries Will mostly use Cadence BuildGates and SOC Encounter, and Artisan TSMC 0.18/0.13um libraries Synthesize small cores from RTL into GDSII

5 Outline Introduction Technology Evolution Design Flows
Silicon Complexity System Complexity Design Flows Traditional State of the Art Design Metrics Design Closure

6 Technology Evolution: Cost and Integration Drivers
Moore’s Law is about cost Increased integration, decreased cost  more possibilities for semiconductor-based products Pentium 4 die shot: 2.2cm Slide courtesy of Mary Jane Irwin, PSU

7 Sense of Scale (Scaling)
What fits on a VLSI Chip today? State of the art logic chip 20mm on a side (400mm2) 0.13mm drawn gate length 0.5m wire pitch 8-level metal For comparison 32b RISC processor 8K l x 16Kl SRAM about 32l x 32l per bit 8K x 16K is 128Kb, 16KB DRAM 8l x 16l per bit 8K x16K is 1Mb, 128KB 0.13mm (2 l) 0.5mm (8 l) 64b FP Processor 20mm (40,000 wire pitches) 320,000 l 32b RISC Processor Slide courtesy of Ken Yang, UCLA

8 MOS Transistor Scaling (1974 to present)
[0.5x per 2 nodes] (Typical MPU/ASIC) Poly Pitch DRAM) Metal Decreased transistor/feature sizes  Increased variability (tox, BEOL, DFM, SEU, etc.) Short channel effect, leakage power Source: ITRS - Exec. Summary, ORTC Figure

9 HP / LOP / LSTP Device Roadmaps
HP / LOP / LSTP Device Roadmaps Parameter Type 99 01 03 05 07 10 13 16 Vdd MPU 1.5 1.2 1.0 0.9 0.7 0.6 0.5 0.4 LOP 1.3 1.1 0.8 LSTP Vth (V) 0.21 0.19 0.13 0.09 0.05 0.021 0.003 0.34 0.36 0.33 0.29 0.25 0.22 0.51 0.53 0.54 0.52 0.49 0.45 Ion (uA/um) 1041 926 967 924 1091 1250 1492 1507 636 600 700 800 900 300 400 500 CV/I (ps) 2.00 1.63 1.16 0.86 0.66 0.39 0.23 0.16 3.50 2.55 2.02 1.58 1.14 0.85 0.56 0.35 4.21 4.61 2.96 2.51 1.81 1.43 0.91 0.57 Ioff (uA/um) 0.00 0.01 0.07 0.30 1.00 3 7 1e-4 3e-4 7e-4 1e-3 3e-3 1e-2 1e-6 3e-6 7e-6 1e-5

10 SEMATECH Prototype BEOL stack, 2000
Wire Via Global (up to 5) Intermediate (up to 4) Local (2) Passivation Dielectric Etch Stop Layer Dielectric Capping Layer Copper Conductor with Barrier/Nucleation Layer Pre Metal Dielectric Tungsten Contact Plug Reverse-scaled global interconnects  Growing interconnect complexity Performance critical global interconnects

11 Intel 130nm BEOL Stack Intel 6LM 130nm process with
vias shown (connecting layers) Aspect ratio = thickness / minimum width

12 Interconnect Capacitance: Parallel Plate Model
ILD = interlevel dielectric L W T Bottom plate of cap can be another metal layer H SiO ILD 2 Substrate Cint = eox * (W*L / tox)

13 Line Dimensions and Fringing Capacitance
Lateral cap w S Capacitive coupling  Crosstalk effect Signal integrity

14 Interconnect Evolution and Modeling Needs
Before 1990, wires were thick and wide while devices were big and slow Large wiring capacitances and device resistances Wiring resistance << device resistance Model wires as capacitances only In the 1990s, scaling (by scale factor S) led to smaller and faster devices and smaller, more resistive wires Reverse scaling of properties of wires RC models became necessary In the 2000s, frequencies are high enough that inductance has become a major component of total impedance

15 Evolving Interconnects Affect Timing
Interconnect capacitance > gate input capacitance Better prediction Interconnect resistance no longer ignorable Better modeling: distributed R(L)C network, AWE, etc. Effective capacitance < total load capacitance Interconnect delay > gate delay for sub-micron technologies

16 Sub-Wavelength Optical Lithography
Second, this is the roadmap for optical lithography. Starting from 350-nanometer process generation, we are making features that are smaller than the wavelength of light. The key: to stay on the roadmap, we will need sub-50 nanometer processes manufactured with 157 nanometer lasers. What are implications of this picture? Slide courtesy of Numerical Technologies, Inc.

17 …Complexity of Photomasks
How many wafers, on average, are printed with a mask set? The first driver is non-recurring engineering cost. Certainly, OPC and Phase-Shift Masks increase this part of the system cost. According to SEMATECH, the cost for a 25-level mask set will cost around 1 million dollars in the 130 nanometer process generation, which arrives one year early, in 2001. Also according to SEMATECH, the average number of wafers that are processed with a given mask set is only 500. So, we can afford to make only high-value designs !

18 Summary of Technology Scaling
Scaling of 0.7x every three (two?) years .25u .18u .13u .10u .07u .05u 5LM 6LM 7LM 7LM 8LM 9LM Interconnect delay dominates system performance consumes up to 70% of clock cycle Cross coupling capacitance is dominating cross capacitance  100%, ground capacitance  0% ground capacitance is 90% in .18u huge signal integrity implications (e.g., guardbands in static analysis approaches) Multiple clock cycles required to cross chip whether 3 or 15 not as important as fact of “multiple” > 1

19 New Materials Implications
Lower dielectric permittivity reduces total capacitance doesn’t change cross-coupled / grounded capacitance proportions Copper metallization reduces RC delay avoids electromigration (factor of 4-5 ?) thinner deposition reduces cross cap Multiple layers of routing enabled by planarization; 10% extra cost per layer reverse-scaled top-level interconnects relative routing pitch may increase room for shielding

20 Technical Issues Manufacturability (chip can't be built)
antenna rules minimum area rules for stacked vias CMP (chemical mechanical polishing) area fill rules layout corrections for optical proximity effects in subwavelength lithography; associated verification issues Signal integrity (failure to meet timing targets) crosstalk induced errors timing dependence on crosstalk IR drop on power supplies Reliability (design failures in the field) electromigration on power supplies hot electron effects on devices wire self heat effects on clocks and signals

21 Courtesy Hormoz/Muddu, ASIC99
Noise Analog design concerns are due to physical noise sources because of discreteness of electronic charge and stochastic nature of electronic transport processes example: thermal noise, flicker noise, shot noise Digital circuits due to large, abrupt voltage swings, create deterministic noise which is several orders of magnitude higher than stochastic physical noise still digital circuits are prevalent because they are inherently immune to noise Technology scaling and performance demands make noisiness of digital circuits a big problem Courtesy Hormoz/Muddu, ASIC99

22 Silicon Complexity Challenges
Silicon Complexity = impact of process scaling, new materials, new device/interconnect architectures Non-ideal scaling (leakage, power management, circuit/device innovation, current delivery) Coupled high-frequency devices and interconnects (signal integrity analysis and management) Manufacturing variability (library characterization, analog and digital circuit performance, error-tolerant design, layout reusability, static performance verification methodology/tools) Scaling of global interconnect performance (communication, synchronization) Decreased reliability (soft error uncertainty, gate insulator tunneling and breakdown, joule heating and electromigration) Complexity of manufacturing handoff (reticle enhancement and mask writing/inspection flow, manufacturing NRE cost) If you don’t know a term, ask…

23 In a PDA… Reference Design: personal digital assistant (PDA)
Composed of CPU, DSP, peripheral I/O, and memory

24 Required Performance for Multi-Media Processing
GOPS 0.01 0.1 1 10 100 Video MPEG1 Extraction MPEG2 Extraction Compression MP/ML MP/HL JPEG MPEG4 Audio Voice Sentence Translation Dolby-AC3 Voice Auto Translation MPEG Word Recognition Graphics 3D Graphics 10Mpps 100Mpps 2D Graphics Communication Recognition VoIP Modem SW Defined Radio Face Recognition Modem Voice Print Recognition FAX Moving Picture Recognition GOPS: Giga Operations Per Second

25 …Implemented With an SoC
0.18um / 400MHz / 470mW (typical) MM Application MP3 JPEG Simple Moving Picture PWR CPG Processor Area PWM RTC FICP SSP CPU 6.5MTrs. Sound I2C GPIO I-cache 32KB D-cache 32KB Max 400MHz USB USB OST Specification MMC MMC I2S DMA controller Available Time 6-10Hr MEM Cnt. LCD Cnt. KEY UART AC97 Data Transfer Area Peripheral Area SDRAM 64MB Flash 32MB LCD 100MHz 4 – 48MHz If the PDA must have 200h standby time with a 120g battery… ?

26 System Complexity Challenges
System Complexity = exponentially increasing transistor counts, with increased diversity (mixed-signal SOC, …) Reuse (hierarchical design support, heterogeneous SOC integration, reuse of verification/test/IP) Verification and test (specification capture, design for verifiability, verification reuse, system-level and software verification, AMS self-test, noise-delay fault tests, test reuse) Cost-driven design optimization (manufacturing cost modeling and analysis, quality metrics, die-package co-optimization, …) Embedded software design (platform-based system design methodologies, software verification/analysis, codesign w/HW) Reliable implementation platforms (predictable chip implementation onto multiple fabrics, higher-level handoff) Design process management (team size / geog distribution, data mgmt, collaborative design, process improvement)

27 Outline Introduction Technology Evolution Design Flows
Silicon Complexity System Complexity Design Flows Traditional State of the Art Design Metrics Design Closure

28 Levels of VLSI Design in a Traditional Flow
Specification what the system (or component) is supposed to do Architecture high-level design of component state defined logic partitioned into major blocks Logic gates, flip-flops, and the connections between them High Level Synthesis GDSII Synthesis Placement Routing Extraction and Timing Verification Manufacturing Architecture Design Verification RTL Circuit transistor circuits to realize logic elements Device behavior of individual circuit elements Layout geometry used to define and connect circuit elements Process steps used to define circuit elements

29 Design Principles (Traditional)
Partition the problem (hirarchical design) Different abstraction levels: RTL, gate-level, switch-level, transistor-level Orthogonize concerns Abstraction vs. implementation Logic vs. timing Constrain the design space to simplify the design process Balance between design complexity and performance E.g., standard-cell methodology

30 VLSI Design Flow Evolution
Expanding in two directions System-on-Chip (SoC) Design Design for Manufacturability (DFM) More design metrics Area Timing Power Signal Integrity Reliability Tighter Integration Design closure RTL/GDSII sign-off re-defined High Level Synthesis GDSII Synthesis Placement Routing Extraction and Timing Verification Manufacturing Architecture Design Verification RTL

31 Design Procedure and Tools
Behavior modeling Matlab/C/VHDL Logic synthesis DesignCompiler, BuildGates, … Verification of synthesis Formal Verification (Verplex) Static timing analysis (PrimeTime) Place and route Astro, SOCE, … Verification of layout DRC, ERC, LVS (Calibre) Extraction (SignalStorm) Delay Calculation (CeltIC) Simulation (SPICE) DFM High Level Synthesis GDSII Synthesis Placement Routing Extraction and Timing Verification Manufacturing Architecture Design Verification RTL

32 Design Principles(State of the Art)
Integrate the problem (design closure) Back-annotation, predictability Balance design metrics Area/timing/power/signal integrity/reliability Explore the design space Balance between design complexity and performance Platform-based SoC design

33 Design Methodologies (+ business models)
Full-Custom (high effort, leading-edge performance, high-volume) Semi-Custom (strong infrastructure, economical in lower volumes) ASIC (Application-Specific Integrated Circuit) Standard Cell/Gate Array/Via Programmable/Structured ASIC FPGA Special Analog (custom layout, I/Os and sense amps) Mixed-Signal / RF (unique to each process, no scaling) System-on-Chip ( System-in-Package) Various components: IP blocks, ASIC, FPGA, memory, uP, RF, etc. Define implementation platform, hardware-software co-design Performance vs. complexity

34 Cell Characterization Verilog Behavioral Model Verilog Structural RTL
Flow Standard Cell Library Wire Model Device model Schematic Entry r,s, m 3-D RLC Modeling Tool Cell Characterization Layers Layout rules Layout Entry Synthesis Library (Timing/Power/Area) Parasitic Extraction Library Place & Route Library (Ports) C-Model Verilog Behavioral Model Structural Model Block Layout Global Layout Synthesis P & R Verilog Structural RTL Floorplan Floorplan P & R DRC/ERC/LVS Static/Dynamic Timing w/extract Functional Functional Power/Area Scan/Testability Static Timing Clock Routing/Analysis Slide courtesy of Mary Jane Irwin, PSU

35 Behavioral Level Design Extraction and Delay Calc. Timing Verification
Traditional Taxonomy Front End Test Generation Design Verification Timing Verification Simulation Floorplanning Logic Partitioning Die Planning Logic Synthesis Logic Design and Behavioral Level Design Global Placement Detail Placement Clock Tree Synthesis and Routing Global Routing Detail Routing Power/Ground Stripes, Rings Routing Extraction and Delay Calc. Timing Verification LVS DRC ERC IO Pad Placement Back End

36 Generic Flow Steps Library preparation Logic design Design for test
Library data preparation Design data preparation Logic design Specification to RTL RTL simulation Hierarchical floorplanning Synthesis Formal verification Gate level simulation Static timing analysis Physical design Physical floorplanning Place and route RC extraction Formal verification Physical verification Release to manufacturing  Design for test   Engineering change order

37 Library and Design Data
Models and technology data required to execute the design flow Power, timing: ALF, DCL, OLA, .lib, STAMP Layout: LEF, DEF, GDSII Delays and path timing, parasitics: SDF, GCF, SDC, DSPF, RSPF, SPEF, SPICE Layout rules: Dracula, Calibre “deck”

38 Architecture Design Platform-based SoC Design Embedded system
Platform is a library of design resources Helps design space exploration Meet in the middle Embedded system Hardware-software co-design Application space Application instance Platform specification System platform Platform design-space exploration Platform instance Architecture space Figure courtesy of Alberto Sangiovanni-Vincentelli, UCB

39 High-Level Synthesis (Behavior  RTL)
Scheduling Assignment of each operation to a time slot corresponding to a clock cycle or time interval Resource allocation Selection of the types of hardware components and the number for each type to be included in the final implementation Module binding Assignment of operation to the allocated hardware components Controller synthesis Design of control style and clocking scheme Compilation of the input specification language to the internal representation Parallelism extraction usually via data flow analysis techniques

40 Architecture Level Floorplanning
Defines the basic chip layout architecture Define the standard cell rows and I/O placement locations Place RAMs and other macros Separate gate array, memory, analog, RF blocks Define power distribution structures such as rings and stripes Allow space for clock, major buses, etc. Rules of thumb for cell density are used to initially calculate design size

41 Logic Synthesis Conversion of RTL to gate-level netlist Timing-driven
Targeted to a foundry-specific library Can be performed hierarchically (block by block) Timing-driven Clock information Primary input arrival times, primary output required times Input driving cells, output loading False paths, multi-cycle paths Interconnect delay may be calculated based on a “wireload model” which uses fanout to estimate delay Clock parameters (insertion delay, skew, jitter, etc.) are assumed to be attainable later in place and route

42 Formal Verification RTL description and gate level netlist are compared to verify functional equivalence, thereby verifying the synthesis results Formal methods Graph isomorphism Binary Decision Diagram (BDD) Emerging technology that supplements the more traditional gate-level simulation approach FV also performed after place-and-route (if gate netlist changes)

43 RTL Simulation RTL code, written in Verilog, VHDL or a combination of both, is simulated to verify functional correctness Testbenches apply input stimulus to the design Several methods are used to verify the outputs Self-checking testbenches automatically verify output correctness and report mismatches Results can be stored in a file and compared to previous results Waveform displays can be used to interactively verify the outputs

44 Gate-Level Simulation
Covers both functionality and timing Correctness is only as good as the test vectors used Especially critical for non-synchronous designs, verification of false path and multi-cycle path constraints Cell timing is included in the simulation models and interconnect delay is passed from the synthesis run Worst case PVT conditions are used to analyze for setup violations, and best case PVT conditions are used to analyze for hold violations PVT = Process, Voltage, Temperature

45 Static Timing Analysis
Verifies that design operates at desired frequency Implicitly assumes correct timing constraints (!), e.g., boundary conditions Timing constraints are similar to those used by logic synthesis Verifies setup and hold times at FF inputs; can also check timing from and to PI’s and PO’s; can also check point-to-point delay values (with blocking of pins, etc.) As with gate-level simulation, both best- and worst-case analysis is performed Typically performed on full-chip (not block) basis May require modified constraints for inter-block issues: multiple clock domains, multi-cycle paths, etc. For compatibility with timing-driven layout flow, helps to have simple / single set of constraints Other issues: incremental analysis, …

46 Block-Level Physical Floorplanning
Reconcile logical and physical hierarchies Cells that are interconnected want to be close together Take advantage of RTL hierarchy Generate a physical hierarchy RTL hierarchy = best physical hierarchy? Often bundled within the same cockpit as the place and route tool Give placement some initial clues to reduce complexity

47 Place and Route Automatically place the standard cells
Generate clock trees Add any remaining power bus connections Route clock lines Route signal interconnects Design rule checks on the routes and cell placements Timing driven tools Require timing constraints and analysis algorithms similar to those used during the static timing analysis step

48 RC(L) Extraction Calculate resistance and capacitance (and inductance) of interconnects Based on placement of cells Routing segments Calculate capacitive (inductive) effects of adjacent segments Extract capacitance between metal segments RC(L) data transferred back to Static timing analysis (back annotation) Gate level simulation Replaces wire load model used in synthesis Drive delay calculation, signal integrity analysis (crosstalk, other noise), static timing Q: How do parasitics and noise affect performance?

49 Physical Verification
DRC – Design Rule Check Spacing, min dimension rules LVS – Layout Versus Schematic Verifies that layout and netlist are equivalent at the transistor level Electrical Rule Check Dangling nets, floating nodes GDSII (Stream Format) Final merge of layout, routing and placement data for mask production

50 Release to Manufacturing
Final edits to the layout are made Metal fill and metal stress relief rules are checked Manufacturing information such as scribe lanes, seal rings, mask shop data, part numbers, logos and pin 1 identification information for assembly are also added DRC and LVS are run to verify the correctness of the modified database ‘Tapeout’ documentation is prepared prior to release of the GDSII to the foundry Pad location information is prepared, typically in a spreadsheet Cadence’s Virtuoso is used for custom-manual edits of the mask layers Manufacturing steps generation of masks silicon processing wafer testing assembly and packaging manufacturing test

51 A More Detailed Design Flow
Architectural optimization (timing) Inter-group buses, bandwidth Clock, SI, test; validation Design Specs Fnl. Design Synthesis Constraints Lib.+CWLM Floorplanning and custom WLM Power distribution (Internal, I/O) I/O driver, padring design Board-level timing, SI Floor-plan & PG Lib.+CWLM Placement Physical re-synth Row definitions Placement of cells Congestion analysis Clock distribution Route, scan re-order Placement-based re-synthesis Noise minimization, isolation Clock distribution Timing analysis, IPO A. Khan, Simplex/Altius Fnl., pwr., SI ECO Full routing Scan stitching, re-ordering Reqmts. ERC, DRC, LVS Full RC back-annotation Hierarchical timing, electrical and SI analysis and IPO/ECO Tape-out

52 Outline Introduction Technology Evolution Design Flows
Silicon Complexity System Complexity Design Flows Traditional State of the Art Design Metrics Design Closure

53 More Design Metrics and Techniques
Area Cell area Wirelength Timing Gate Interconnect Power Dynamic Static Leakage Signal Integrity Crosstalk (capacitive, inductive) Supply voltage drop (IR drop, LdI/dt) Reliability Variation (Vdd, thermal, process variation (tox, BEOL)) Electromigration Hot electron effect (SEU) Cost minimization Synthesis (technology mapping) Placement, routing Performance optimization Logic transformation, transistor sizing Buffering, re-routing Power minimization Gating (sleep transistors), variant Vdd Process optimization Dual-Vth Signal Integrity Sizing, net ordering, shielding P/G design, placement, synthesis Reliability Statistical design optimization Design margin

54 Design Flow Evolution (ITRS-2003)

55 Design Convergence Drivers and Approaches

56 Wireload Model Helps delay estimation at synthesis stage Empirical
Gate delay = f(input slew, load cap) Wire cap = f’(fanout number) Empirical Different for each technology, library, tool, design, and design stage Statistical (from library), custom (multiple iterations), structural (look at adjacent nets) … Large deviation remains Routing obstacles (hard IP blocks, macros, etc.) Routing algorithms/implementations (timing driven, net ordering, details)

57 Interconnect Statistics
Local Interconnect Global Interconnect if Ld is the die diagonal ~ sqrt (Ad) where Ad is the chip area average length of global wires is Lav ~ sqrt (Ad)/3 What are some implications?

58 Rent’s Rule Power law distribution N = Gp N: number of nets
G: number of gates p: Rent exponent between 0 ~ 1 Foundation of statistical interconnect prediction Empirical, unclear theoretical root lgN lgG

59 Constructive Interconnect Prediction
Statistical models have their limitations Critical paths and the law of small numbers Statistics properties, e.g., average wirelength Extreme statistics properties, e.g., critical path length Implementation details Routing congestion, e.g., horizontal effect Timing optimization, e.g., layer assignment Via blockage, pin accessability, wrong way routing, etc. Predict by construction (physical synthesis) try a fast (global) router Scheffer and Nequist, Proc. ACM SLIP 2000, pp

60 Goal: Design Convergence
What must converge? logic, timing, power, SI, reliability in a physical embedding support front-end signoff with a predictable back-end Achieve Convergence through Predictability correct by construction (“assume, then enforce”) constraints and assumptions passed downstream; not much goes upstream ignores concerns via guardbanding separates concerns as able (e.g., FE logic/timing vs. BE spatial embedding) construct by correction (“tight loops”) logic-layout unification; synthesis-analysis unification, concurrent optimization elimination of concerns reduced degrees of freedom, pre-emptive design techniques e.g., power distribution, layer assignment / repeater rules What must converge ? Logic, Timing, and Spatial Embedding. And Design Convergence means supporting front-end signoff with a predictable back-end. There are MANY ways to achieve predictability. The obvious approach is statistical: regressions. Wireload models are a crude example. Here, the first approach is correct by construction: assume a result, then make sure it happens. Examples are constant-delay synthesis, or using hard chip-level routes to define global timing and pin assignments before block synthesis. There is little iteration, but lots of guardbanding. The second approach is construct by correction. We know there will be a lot of iteration, but we architect the tools to support it. Examples are unified logic and layout synthesis, or, unified analysis and synthesis, such as having incremental extraction and static timing tied to incremental place and route. The idea is powerful, but hard to implement. Finally, we can PREVENT problems. With rules for repeater insertion, slew time control, and layer assignment I can solve most sizing and signal integrity issues. Inductance is predictable with grounded shields every 16 tracks. If we can PREVENT problems, then we can IGNORE them. This is also a powerful idea, but has costs. The bottom line is that there are MANY reasonable ways of achieving predictability. Therefore, MANY approaches to design closure are possible. In fact, at the DAC-2000 panel on Design Closure, 7 companies showed 7 different recipes (the slide is in your handout).

61 “Physical Prototyping Philosophy”
Prototype delivers accurate physical data Levels of accuracy Placement-acknowledgeable synthesis (PKS) Including global route Post-detailed-route (In-Place Optimization, i.e., IPO) Hierarchical timing budgeting: Chip-level CTS, top-level route and IPO, power analysis and grid design Block-level synthesis, placement, IPO, routing “Handoff with enough physical information to ensure correct results” RTL Functionality known Gates Physical Prototype Timing / routability known Floorplan / Placement Routing M. Courtoy, Silicon Perspective

62 Block-Level Timing Budgets Block-Level Pin Assignments
Coarse Placement Drives Partitioning, Coarse Routing Drives Pin Assignment / Timing Opt Full-chip prototype results in optimal pin placement Results in narrower channels and reduced die size Reduces the routing congestion Improves the chip timing Accurate timing budgets result in predictable timing convergence Partitioning Physical Prototype Block 1 Block 2 Block 3 Block-Level Timing Budgets Block-Level Pin Assignments M. Courtoy, Silicon Perspective

63 Cool Pictures of the Pieces…
Full Chip Power Planning Place Detailed Trial Route RC Extraction Delay Calc / STA IPO Timing Closure Power IR Drop Analysis Full Chip Physical Prototype Hierarchical Clock Tree Synthesis 150ps skew 120ps skew 50ps 100ps 130ps Block-Level Optimization Partition M. Courtoy, Silicon Perspective “Tape Out Every Day”


Download ppt "ECE260B – CSE241A Winter 2005 Introduction and ASIC Flow"

Similar presentations


Ads by Google