Pre-layout prediction of interconnect manufacturability Phillip Christie University of Delaware USA Jose Pineda de Gyvez Philips Research Laboratories.

Slides:

Advertisements

Similar presentations

-1- VLSI CAD Laboratory, UC San Diego Post-Routing BEOL Layout Optimization for Improved Time- Dependent Dielectric Breakdown (TDDB) Reliability Tuck-Boon.

Advertisements

Cadence Design Systems, Inc. Why Interconnect Prediction Doesn’t Work.

Hoofdstuk 6 Het voorspellen van prestaties Prof. dr. ir. Dirk Stroobandt Academiejaar

High-Level Constructors and Estimators Majid Sarrafzadeh and Jason Cong Computer Science Department

The Impact of Variability on the Reliability of Long on-chip Interconnect in the Presence of Crosstalk Basel Halak, Santosh Shedabale, Hiran Ramakrishnan,

Physical Design Routing Driven Design Closure 1. Algorithms and Data Structures for Fast Routing to Handle Increasing Design Complexity Dirk Mueller (Post-doctoral.

EECE579: Digital Design Flows

Problem 1 Defining Netlist Snarl Factor. Some Background A B C D F G EH A B C D F G EH Congested area PlacementRouting A B C D F G E H Netlist == Graph.

1 09/07/01 PD: Verification Vs. Modification Global Routing Detail Routing Placement Clock Tree Synthesis Power/Ground Stripes, Rings Routing IO Pad Placement.

Architectural-Level Prediction of Interconnect Wirelength and Fanout Kwangok Jeong, Andrew B. Kahng and Kambiz Samadi UCSD VLSI CAD Laboratory

On Modeling and Sensitivity of Via Count in SOC Physical Implementation Kwangok Jeong Andrew B. Kahng.

Dirk Stroobandt Ghent University Electronics and Information Systems Department A Priori System-Level Interconnect Prediction The Road to Future Computer.

University of Toronto Pre-Layout Estimation of Individual Wire Lengths Srinivas Bodapati (Univ. of Illinois) Farid N. Najm (Univ. of Toronto)

Non-tree Routing for Reliability & Yield Improvement A.B. Kahng – UCSD B. Liu – Incentia I.I. Mandoiu – UCSD Work supported by Cadence, MARCO GSRC, and.

CSE241 Formal Verification.1Cichy, UCSD ©2003 CSE241A VLSI Digital Circuits Winter 2003 Recitation 5: File Formats.

Managing Interconnect Resources Embedded SLIP Tutorial Phillip Christie.

ISPD 2000, San DiegoApr 10, Requirements for Models of Achievable Routing Andrew B. Kahng, UCLA Stefanus Mantik, UCLA Dirk Stroobandt, Ghent.

1 3/22/02 Benchmark Update u Carnegie Cell Library: “Free to all who Enter” s Need to build scaling model of standard cell library s Based on our open.

Ryan Kastner ASIC/SOC, September Coupling Aware Routing Ryan Kastner, Elaheh Bozorgzadeh and Majid Sarrafzadeh Department of Electrical and Computer.

SLIP 2000April 9, Wiring Layer Assignments with Consistent Stage Delays Andrew B. Kahng (UCLA) Dirk Stroobandt (Ghent University) Supported.

Cost-Based Tradeoff Analysis of Standard Cell Designs Peng Li Pranab K. Nag Wojciech Maly Electrical and Computer Engineering Carnegie Mellon University.

1 ENTITY test is port a: in bit; end ENTITY test; DRC LVS ERC Circuit Design Functional Design and Logic Design Physical Design Physical Verification and.

Signal Integrity Methodology on 300 MHz SoC using ALF libraries and tools Wolfgang Roethig, Ramakrishna Nibhanupudi, Arun Balakrishnan, Gopal Dandu Steven.

A Methodology for Interconnect Dimension Determination By: Jeff Cobb Rajesh Garg Sunil P Khatri Department of Electrical and Computer Engineering, Texas.

MASSOUD PEDRAM UNIVERSITY OF SOUTHERN CALIFORNIA Interconnect Length Estimation in VLSI Designs: A Retrospective.

Global Routing.

CAD for Physical Design of VLSI Circuits

UC San Diego / VLSI CAD Laboratory Toward Quantifying the IC Design Value of Interconnect Technology Improvement Tuck-Boon Chan, Andrew B. Kahng, Jiajia.

MARS A Scan-Island Based Design Enabling Pre-Bond Testability in Die-Stacked Microprocessors Dean L. Lewis Hsien-Hsin S. Lee Georgia Institute of Technology.

TSV-Aware Analytical Placement for 3D IC Designs Meng-Kai Hsu, Yao-Wen Chang, and Valerity Balabanov GIEE and EE department of NTU DAC 2011.

ASIC Design Flow – An Overview Ing. Pullini Antonio

1 Wire Length Prediction-based Technology Mapping and Fanout Optimization Qinghua Liu Malgorzata Marek-Sadowska VLSI Design Automation Lab UC-Santa Barbara.

Improved Cut Sequences for Partitioning Based Placement Mehmet Can YILDIZ and Patrick H. Madden State University of New York at BinghamtonComputer Science.

Modern VLSI Design 3e: Chapter 2 Copyright  1998, 2002 Prentice Hall PTR Topics n Design rules and fabrication. n SCMOS scalable design rules. n Stick.

CSE 494: Electronic Design Automation Lecture 2 VLSI Design, Physical Design Automation, Design Styles.

Massachusetts Institute of Technology 1 L14 – Physical Design Spring 2007 Ajay Joshi.

Detailed Routing: New Challenges

Kwangsoo Han‡, Andrew B. Kahng‡† and Hyein Lee‡

Georgia Institute of Technology, Microelectronics Research Center Prediction of Interconnect Fan-out Distribution Using Rent’s Rule Payman Zarkesh-Ha,

Congestion Estimation and Localization in FPGAs: A Visual Tool for Interconnect Prediction David Yeager Darius Chiu Guy Lemieux The University of British.

NUMERICAL TECHNOLOGIES, INC. Assessing Technology tradeoffs for 65nm logic circuits D Pramanik, M Cote, K Beaudette Numerical Technologies Inc Valery Axelrad.

EE 466/586 VLSI Design Partha Pande School of EECS Washington State University

Fujitsu Labs, January 20, 2003 Non-tree Routing for Reliability and Yield Improvement Ion Mandoiu CSE Department, UC San Diego Joint work with A.B. Kahng.

International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 1 Wirelength Estimation based on Rent Exponents.

1 CS612 Algorithms for Electronic Design Automation CS 612 – Lecture 1 Course Overview Mustafa Ozdal Computer Engineering Department, Bilkent University.

DEVICES AND DESIGN : ASIC. DEFINITION Any IC other than a general purpose IC which contains the functionality of thousands of gates is usually called.

1 Carnegie Mellon University Center for Silicon System Implementation An Architectural Exploration of Via Patterned Gate Arrays Chetan Patel, Anthony Cozzie,

"Fast estimation of the partitioning Rent characteristic" Fast estimation of the partitioning Rent characteristic using a recursive partitioning model.

Dirk Stroobandt Ghent University Electronics and Information Systems Department A Priori System-Level Interconnect Prediction Rent’s Rule and Wire Length.

Dirk Stroobandt Ghent University Electronics and Information Systems Department A New Design Methodology Based on System-Level Interconnect Prediction.

Design For Manufacturability in Nanometer Era

Interconnect Characteristics of 2.5-D System Integration Scheme Yangdong (Steven) Deng & Wojciech P. Maly

Dept. of Electronics Engineering & Institute of Electronics National Chiao Tung University Hsinchu, Taiwan ISPD’16 Generating Routing-Driven Power Distribution.

Dirk Stroobandt Ghent University Electronics and Information Systems Department Multi-terminal Nets do Change Conventional Wire Length Distribution Models.

Written by Whitney J. Wadlow

EE4271 VLSI Design VLSI Channel Routing.

-1- Soft Core Viterbi Decoder EECS 290A Project Dave Chinnery, Rhett Davis, Chris Taylor, Ning Zhang.

Prediction of Interconnect Net-Degree Distribution Based on Rent’s Rule Tao Wan and Malgorzata Chrzanowska- Jeske Department of Electrical and Computer.

1 EE 382M VLSI 1 EE 360R Computer-Aided Integrated Circuit Design Lab 1 Demo Fall 2011 Whitney J. Wadlow.

Slide 1 SLIP 2004 Payman Zarkesh-Ha, Ken Doniger, William Loh, and Peter Bendix LSI Logic Corporation Interconnect Modeling Group February 14, 2004 Prediction.

Introduction to ASICs ASIC - Application Specific Integrated Circuit

VLSI Physical Design Automation

The Interconnect Delay Bottleneck.

Revisiting and Bounding the Benefit From 3D Integration

Defect Tolerance for Nanocomputer Architecture

EE141 Design Styles and Methodologies

ECE 556 Project Presentation

An Automated Design Flow for 3D Microarchitecture Evaluation

EE4271 VLSI Design, Fall 2016 VLSI Channel Routing.

Presentation transcript:

Pre-layout prediction of interconnect manufacturability Phillip Christie University of Delaware USA Jose Pineda de Gyvez Philips Research Laboratories The Netherlands

BEOD and BEOL Optimization The BEBOP Project Back end of line Dielectric processes Metal processes Yield Planarization Silicon processes Front end of line Back end of design Floor planning Placement Routing Timing closure Synthesis Front end of design Technology file SLIP Tools (MATLAB WireTools)

Netlist signature Netlist Floorplan Placement Yield Routing Terminals per net (tpn) Nets per cell (npc)

Rent exponent Netlist Floorplan Placement Yield Routing

Wiring signature cube npc tpn p Netlist Floorplan Placement Yield Routing

Floorplan design Netlist Floorplan Placement Yield Routing

Site occupancy probability Netlist Floorplan Placement Yield Routing Probability of occupancy Number of available sites Linear axes

Model Development Wire length distribution p= Netlist Floorplan Placement Applications Routing

Routing Model Netlist Floorplan Placement Yield Routing implemented with via blocking

Netlist Floorplan Placement Yield Routing Yield prediction

Netlist Floorplan Placement Yield Routing

Cut model Netlist Floorplan Placement Yield Routing defect size, x wire length, l x=1.5w x=1.2w x=w wire width, w length of cut critical area = l width of critical area = x-w

Bridge model length of bridge critical area = m+x x=1.2s x=1.5s x=s wire overlap length, m Netlist Floorplan Placement Yield Routing

Probability of Failure Netlist Floorplan Placement Yield Routing Defect size distributionSensitivityProbability of Failure = X

Cut sensitivity prediction Netlist Floorplan Placement Yield Routing x Defect size Sensitivity

Bridge sensitivity prediction Netlist Floorplan Placement Yield Routing 0123 x Defect size Sensitivity

Theory versus experiment Netlist Floorplan Placement Yield Routing POF n (predicted)2.92%2.92%2.91%2.90%0.61%0.34% POF n (extracted)2.80%2.53%2.09%2.30%0.49%0.36% POF n (predicted)1.14%1.14%1.13%1.13%0.21%0.21% POF n (extracted)1.82%1.53%1.17%1.13%0.28%0.16% Layer Cuts Bridges

Conclusions  Wiretools is a program development environment for interconnect analysis  Wiretools enables technology and design exploration (BEBOP)  Cut model easy to implement if wire length distribution known  Bridge model can be modeled using basic probability theory  Yield modeling is critical for interconnect geometry optimization

Acknowledgements  William Rey, Leo Sevat, Martijn Bennebroek  Philips Research Laboratories  National Science Foundation (CCR )