A Cost-Driven Lithographic Correction Methodology Based on Off-the-Shelf Sizing Tools.

Slides:



Advertisements
Similar presentations
Explicit Gate Delay Model for Timing Evaluation Muzhou Shao : University of Texas at Austin D.F.Wong : U. of Illinois at Urbana- Champaign Huijing Cao.
Advertisements

University of Toronto Minimization of Delay Sensitivity to Process Induced Vth Variations Georges Nabaa Farid N. Najm University of Toronto
Design Rule Generation for Interconnect Matching Andrew B. Kahng and Rasit Onur Topaloglu {abk | rtopalog University of California, San Diego.
Cadence Design Systems, Inc. Why Interconnect Prediction Doesn’t Work.
Courtesy RK Brayton (UCB) and A Kuehlmann (Cadence) 1 Logic Synthesis Sequential Synthesis.
Ispd-2007 Repeater Insertion for Concurrent Setup and Hold Time Violations with Power-Delay Trade-Off Salim Chowdhury John Lillis Sun Microsystems University.
Logic Synthesis – 3 Optimization Ahmed Hemani Sources: Synopsys Documentation.
ELEN 468 Lecture 261 ELEN 468 Advanced Logic Design Lecture 26 Interconnect Timing Optimization.
Xing Wei, Wai-Chung Tang, Yu-Liang Wu Department of Computer Science and Engineering The Chinese University of HongKong
Improving Placement under the Constant Delay Model Kolja Sulimma 1, Ingmar Neumann 1, Lukas Van Ginneken 2, Wolfgang Kunz 1 1 EE and IT Department University.
High-Level Constructors and Estimators Majid Sarrafzadeh and Jason Cong Computer Science Department
FPGA Latency Optimization Using System-level Transformations and DFG Restructuring Daniel Gomez-Prado, Maciej Ciesielski, and Russell Tessier Department.
The Cost of Fixing Hold Time Violations in Sub-threshold Circuits Yanqing Zhang, Benton Calhoun University of Virginia Motivation and Background Power.
1 A Lithography-friendly Structured ASIC Design Approach By: Salman Goplani* Rajesh Garg # Sunil P Khatri # Mosong Cheng # * National Instruments, Austin,
: Grid graph :Draw two rays from each concave point Rays are divided into non-intersected ray-segments Conflict pair: two ray segments from the same point.
Modern VLSI Design 2e: Chapter4 Copyright  1998 Prentice Hall PTR.
Power-Aware Placement
UC San Diego Computer Engineering VLSI CAD Laboratory UC San Diego Computer Engineering VLSI CAD Laboratory UC San Diego Computer Engineering VLSI CAD.
Statistical Crosstalk Aggressor Alignment Aware Interconnect Delay Calculation Supported by NSF & MARCO GSRC Andrew B. Kahng, Bao Liu, Xu Xu UC San Diego.
Technology Mapping.
An Algorithm to Minimize Leakage through Simultaneous Input Vector Control and Circuit Modification Nikhil Jayakumar Sunil P. Khatri Presented by Ayodeji.
Design Sensitivities to Variability: Extrapolations and Assessments in Nanometer VLSI Y. Kevin Cao *, Puneet Gupta +, Andrew Kahng +, Dennis Sylvester.
Rule-based Price Discovery Methods in Transportation Procurement Auctions Jiongjiong Song Amelia Regan Institute of Transportation Studies University of.
UC San Diego Computer Engineering. VLSI CAD Laboratory.. UC San Diego Computer EngineeringVLSI CAD Laboratory.. UC San Diego Computer EngineeringVLSI CAD.
On-Line Adjustable Buffering for Runtime Power Reduction Andrew B. Kahng Ψ Sherief Reda † Puneet Sharma Ψ Ψ University of California, San Diego † Brown.
Toward Performance-Driven Reduction of the Cost of RET-Based Lithography Control Dennis Sylvester Jie Yang (Univ. of Michigan,
Toward a Methodology for Manufacturability-Driven Design Rule Exploration Luigi Capodieci, Puneet Gupta, Andrew B. Kahng, Dennis Sylvester, and Jie Yang.
A Probabilistic Method to Determine the Minimum Leakage Vector for Combinational Designs Kanupriya Gulati Nikhil Jayakumar Sunil P. Khatri Department of.
ELEN 468 Lecture 271 ELEN 468 Advanced Logic Design Lecture 27 Interconnect Timing Optimization II.
Layout-based Logic Decomposition for Timing Optimization Yun-Yin Lien* Youn-Long Lin Department of Computer Science, National Tsing Hua University, Hsin-Chu,
Topography-Aware OPC for Better DOF margin and CD control Puneet Gupta*, Andrew B. Kahng*†‡, Chul-Hong Park†, Kambiz Samadi†, and Xu Xu‡ * Blaze-DFM Inc.
Triple Patterning Aware Detailed Placement With Constrained Pattern Assignment Haitong Tian, Yuelin Du, Hongbo Zhang, Zigang Xiao, Martin D.F. Wong.
Selective Gate-Length Biasing for Cost-Effective Runtime Leakage Control Puneet Gupta 1 Andrew B. Kahng 1 Puneet Sharma 1 Dennis Sylvester 2 1 ECE Department,
FPGA Technology Mapping. 2 Technology mapping:  Implements the optimized nodes of the Boolean network to the target device library.  For FPGA, library.
1 Reconfigurable ECO Cells for Timing Closure and IR Drop Minimization TingTing Hwang Tsing Hua University, Hsin-Chu.
1 A Method for Fast Delay/Area Estimation EE219b Semester Project Mike Sheets May 16, 2000.
UC San Diego Computer Engineering VLSI CAD Laboratory UC San Diego Computer Engineering VLSI CAD Laboratory UC San Diego Computer Engineering VLSI CAD.
Signal Integrity Methodology on 300 MHz SoC using ALF libraries and tools Wolfgang Roethig, Ramakrishna Nibhanupudi, Arun Balakrishnan, Gopal Dandu Steven.
1 VLSI CAD Flow: Logic Synthesis, Lecture 13 by Ajay Joshi (Slides by S. Devadas)
Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Topics n Interconnect design. n Crosstalk. n Power optimization.
Capturing Crosstalk-Induced Waveform for Accurate Static Timing Analysis Masanori Hashimoto, Yuji Yamada, Hidetoshi Onodera Kyoto University.
Seongbo Shim, Yoojong Lee, and Youngsoo Shin Lithographic Defect Aware Placement Using Compact Standard Cells Without Inter-Cell Margin.
CAD for Physical Design of VLSI Circuits
ASIC Design Flow – An Overview Ing. Pullini Antonio
© J. Christopher Beck Lecture 5: Project Planning 2.
An ASIC Design methodology with Predictably Low Leakage, using Leakage-immune Standard Cells Nikhil Jayakumar, Sunil P Khatri ISLPED’03.
-1- UC San Diego / VLSI CAD Laboratory Construction of Realistic Gate Sizing Benchmarks With Known Optimal Solutions Andrew B. Kahng, Seokhyeong Kang VLSI.
CSE 494: Electronic Design Automation Lecture 2 VLSI Design, Physical Design Automation, Design Styles.
Accelerating Statistical Static Timing Analysis Using Graphics Processing Units Kanupriya Gulati and Sunil P. Khatri Department of ECE, Texas A&M University,
Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Combinational network delay. n Logic optimization.
Introduction to CMOS VLSI Design Lecture 5: Logical Effort GRECO-CIn-UFPE Harvey Mudd College Spring 2004.
ECO Timing Optimization Using Spare Cells Yen-Pin Chen, Jia-Wei Fang, and Yao-Wen Chang ICCAD2007, Pages ICCAD2007, Pages
Impact of Interconnect Architecture on VPSAs (Via-Programmed Structured ASICs) Usman Ahmed Guy Lemieux Steve Wilton System-on-Chip Lab University of British.
A Cost-Driven Lithographic Correction Methodology Based on Off-the-Shelf Sizing Tools A Cost-Driven Lithographic Correction Methodology Based on Off-the-Shelf.
Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Interconnect design. n Crosstalk. n Power optimization.
Pattern Sensitive Placement For Manufacturability Shiyan Hu, Jiang Hu Department of Electrical and Computer Engineering Texas A&M University College Station,
Outline Introduction: BTI Aging and AVS Signoff Problem
Dec 1, 2003 Slide 1 Copyright, © Zenasis Technologies, Inc. Flex-Cell Optimization A Paradigm Shift in High-Performance Cell-Based Design A.
Physical Synthesis Buffer Insertion, Gate Sizing, Wire Sizing,
On the Assumption of Normality in Statistical Static Timing Analysis Halim Damerdji, Ali Dasdan, Santanu Kolay February 28, 2005 PrimeTime Synopsys, Inc.
Technology Mapping. 2 Technology mapping is the phase of logic synthesis when gates are selected from a technology library to implement the circuit. Technology.
Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Topics n Combinational network delay. n Logic optimization.
Static Timing Analysis
1 Timing Closure and the constant delay paradigm Problem: (timing closure problem) It has been difficult to get a circuit that meets delay requirements.
Dirk Stroobandt Ghent University Electronics and Information Systems Department Multi-terminal Nets do Change Conventional Wire Length Distribution Models.
Yuxi Liu The Chinese University of Hong Kong Circuit Timing Problem Driven Optimization.
University of Michigan Advanced Computer Architecture Lab. 2 CAD Tools for Variation Tolerance David Blaauw and Kaviraj Chopra University of Michigan.
Introduction to Decision Analysis & Modeling
Standard-Cell Mapping Revisited
On the Improvement of Statistical Timing Analysis
Presentation transcript:

A Cost-Driven Lithographic Correction Methodology Based on Off-the-Shelf Sizing Tools

Outline Introduction –Trends in mask cost –Design for value –The cost of correction problem Cost of Correction Methodology –Mapping the MinCorr problem to conventional performance optimization Experimental Testbed –Yield aware library characterization –Synthesis tool Results and discussion Conclusions and ongoing work

Outline Introduction –Trends in mask cost –Design for value –The cost of correction problem Cost of Correction Methodology –Mapping the MinCorr problem to conventional performance optimization Experimental Testbed –Yield aware library characterization –Synthesis tool Results and discussion Conclusions and ongoing work

Introduction Trends in Mask Cost –Mask data preparation is a serious bottleneck due to the heavily applied RET Figure count explodes as dimensions shrink Data volume for a single mask layer can approach 100GB

Introduction (Cont.) Trends in Mask Cost (Cont.) –Mask set cost increases at an accelerated rate with RET application as the primary driver Need to determine how best to apply RETs to standard cell libraries to minimize mask cost

Introduction (Cont.) Cost of correction problem –Entire layout is corrected uniformly with the same effort in current OPC technologies –Less aggressive use of OPC results in lowered cost through shorter mask write time and higher mask yield –Determine the level of correction for each feature without sacrificing the prescribed selling point delay: minimum cost of correction (MinCorr)

Outline Introduction –Trends in mask cost –Design for value –The cost of correction problem Cost of Correction Methodology –Mapping the MinCorr problem to conventional performance optimization Experimental Testbed –Yield aware library characterization –Synthesis tool Results and discussion Conclusions and ongoing work

Cost of Correction Methodology Yield closure flow –Assume different levels of OPC can be independently applied to any gate in the design with corresponding L and cost –Compute selling point delay at each primary output

Mapping MinCorr to Traditional Performance Optimization Assume standard deviations of the gate-delays are additive: –Allows the use of STA instead of SSTA –Likely to be pessimistic: Results from extreme value theory can be used to increase likelihood of the selling point delay being overestimated. Construct yield libraries in a similar fashion as timing libraries. –Allows the use of commercial synthesis tools.

Outline Introduction –Trends in mask cost –Design for value –The cost of correction problem Cost of Correction Methodology –Mapping the MinCorr problem to conventional performance optimization Experimental Testbed –Yield aware library characterization –Synthesis tool Results and discussion Conclusions and ongoing work

Experimental Testbed Three level OPC correction Yield aware library characterization –Based on a reduced TSMC.lib (containing 28 cells) generate new library files corresponding to each level of OPC correction Mask cost model –Figure count given as a multiple of that found in a non-OPC layout Synthesis tool –We use Synopsys DC, to solve the MinCorr problem –Enables us to try out interesting variant problems such as cost constrained selling point delay minimization

Outline Introduction –Trends in mask cost –Design for value –The cost of correction problem Cost of Correction Methodology –Mapping the MinCorr problem to conventional performance optimization Experimental Testbed –Yield aware library characterization –Synthesis tool Results and discussion Conclusions and ongoing work

Results and discussion alu128 and c7552 are 2000 gate combinational designs. Little (about 4%) variation in selling point delay from max- corrected to min-corrected versions of the design –Small gate delay change for these OPC levels –We assume no input cap. Change with variation. With second order effects are considered, changes in selling point delay are expected to be larger

Outline Introduction –Trends in mask cost –Design for value –The cost of correction problem Cost of Correction Methodology –Mapping the MinCorr problem to conventional performance optimization Experimental Testbed –Yield aware library characterization –Synthesis tool Results and discussion Conclusions and ongoing work

It is possible to reduce the total cost of OPC while still meeting yield and cycle time targets by making OPC design aware Conventional gate-sizing methods can be easily modified to solve the MinCorr cost of correction problem. We have given a recipe to use an industry standard synthesis tool to perform the job OPC might be more of a manufacturability issue rather than a performance or yield issue With sizing based optimizations and selective OPC, we can save up to 77% cost compared to aggressive OPC, without increasing the selling point delay. Design performance oblivious RET techniques suffer from large cost overheads

Conclusions and ongoing work Statistical Static Timing Analysis based correction: use SSTA to validate the sizing results and heuristically “fix” the sizing solution: –Gates that fanout to a large number of critical paths are good candidates for correction –Gates that fanout to a small number of critical paths are good candidates for decorrection Alternative approaches to correction –Transistor sizing instead of gate-sizing –Cost based delay budgeting methods More accurate correction –Input slew awareness in the yield libraries and including interconnect in the analysis –Consider dependence of gate input capacitance on L variation in the yield libraries