Reap What You Sow: Spare Cells for Post-Silicon Metal Fix Kai-hui Chang, Igor L. Markov and Valeria Bertacco ISPD’08, Pages 103-110.

Slides:



Advertisements
Similar presentations
Digital Integrated Circuits© Prentice Hall 1995 Design Methodologies Design for Test.
Advertisements

Digital Integrated Circuits© Prentice Hall 1995 Combinational Logic COMBINATIONAL LOGIC.
Gregory Shklover, Ben Emanuel Intel Corporation MATAM, Haifa 31015, Israel Simultaneous Clock and Data Gate Sizing Algorithm with Common Global Objective.
Caleb Serafy and Ankur Srivastava Dept. ECE, University of Maryland
Functions and Functional Blocks
Automated Method Eliminates X Bugs in RTL and Gates Kai-hui Chang, Yen-ting Liu and Chris Browy.
June 6, Using Negative Edge Triggered FFs to Reduce Glitching Power in FPGA Circuits Tomasz S. Czajkowski and Stephen D. Brown Department of Electrical.
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTES Logic Simulation.
NCHUCS1 Scan Chain Reorder Sying-Jyan Wang Department of Computer Science National Chung-Hsing University.
Meng-Kai Hsu, Sheng Chou, Tzu-Hen Lin, and Yao-Wen Chang Electronics Engineering, National Taiwan University Routability Driven Analytical Placement for.
National Tsing Hua University Po-Yang Hsu,Hsien-Te Chen,
Post-Placement Voltage Island Generation for Timing-Speculative Circuits Rong Ye†, Feng Yuan†, Zelong Sun†, Wen-Ben Jone§ and Qiang Xu†‡
Statistical Full-Chip Leakage Analysis Considering Junction Tunneling Leakage Tao Li Zhiping Yu Institute of Microelectronics Tsinghua University.
EECE579: Digital Design Flows
1 A Lithography-friendly Structured ASIC Design Approach By: Salman Goplani* Rajesh Garg # Sunil P Khatri # Mosong Cheng # * National Instruments, Austin,
Presenter : Shao-Jay Hou. Today’s complex integrated circuit designs increasingly rely on post-silicon validation to eliminate bugs that escape from pre-silicon.
1 DESIGN OF 8-BIT ALU Vijigish Lella Harish Gogineni Bangar Raju Singaraju Advisor: Dr. David W. Parent 8 May 2006.
Fuzzy Evolutionary Algorithm for VLSI Placement Sadiq M. SaitHabib YoussefJunaid A. Khan Department of Computer Engineering King Fahd University of Petroleum.
 2000 M. CiesielskiPTL Synthesis1 Synthesis for Pass Transistor Logic Maciej Ciesielski Dept. of Electrical & Computer Engineering University of Massachusetts,
Digital Integrated Circuits© Prentice Hall 1995 Combinational Logic COMBINATIONAL LOGIC.
Threshold Voltage Assignment to Supply Voltage Islands in Core- based System-on-a-Chip Designs Project Proposal: Gall Gotfried Steven Beigelmacher 02/09/05.
CDCTree: Novel Obstacle-Avoiding Routing Tree Construction based on Current Driven Circuit Model Speaker: Lei He.
In this module you will learn: What the various logic gates do. How to represent logic gates on a circuit diagram. The truth tables for the logic gates.
A Methodology for Interconnect Dimension Determination By: Jeff Cobb Rajesh Garg Sunil P Khatri Department of Electrical and Computer Engineering, Texas.
A Topology-based ECO Routing Methodology for Mask Cost Minimization Po-Hsun Wu, Shang-Ya Bai, and Tsung-Yi Ho Department of Computer Science and Information.
Introduction to Digital Logic Design Appendix A of CO&A Dr. Farag
Combinational Circuits Chapter 3 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer, 2003.
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Lecture 12 – Design Procedure.
Power Reduction for FPGA using Multiple Vdd/Vth
1 Coupling Aware Timing Optimization and Antenna Avoidance in Layer Assignment Di Wu, Jiang Hu and Rabi Mahapatra Texas A&M University.
A comparison between different logic synthesis techniques from the digital switching noise viewpoint G. Boselli, V. Ciriani, V. Liberali G. Trucco Dept.
Seongbo Shim, Yoojong Lee, and Youngsoo Shin Lithographic Defect Aware Placement Using Compact Standard Cells Without Inter-Cell Margin.
Cristian Urs and Ben Riveira. Introduction The article we chose focuses on improving the performance of Genetic Algorithms by: Use of predictive models.
CS1Q Computer Systems Lecture 8
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.
A NEW ECO TECHNOLOGY FOR FUNCTIONAL CHANGES AND REMOVING TIMING VIOLATIONS Jui-Hung Hung, Yao-Kai Yeh,Yung-Sheng Tseng and Tsai-Ming Hsieh Dept. of Information.
CSE 494: Electronic Design Automation Lecture 2 VLSI Design, Physical Design Automation, Design Styles.
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
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
1/14 Synthesis and Design of Parameter Extractors for Low-Power Pre-computation-Based Content-addressable Memory Using Gate- Block Selection Algorithm.
Gates and Logic Dr John Cowell phones off (please)
4. Combinational Logic Networks Layout Design Methods 4. 2
RF network in SoC1 SoC Test Architecture with RF/Wireless Connectivity 1. D. Zhao, S. Upadhyaya, M. Margala, “A new SoC test architecture with RF/wireless.
1 Efficient Obstacle-Avoiding Rectilinear Steiner Tree Construction Chung-Wei Lin, Szu-Yu Chen, Chi-Feng Li, Yao-Wen Chang, Chia-Lin Yang National Taiwan.
Frankfurt (Germany), 6-9 June 2011 Detailed Analysis of the Impact of Distributed Generation and Active Network Management on Network Protection Systems.
Detecting Errors Using Multi-Cycle Invariance Information Nuno Alves, Jennifer Dworak, and R. Iris Bahar Division of Engineering Brown University Providence,
EE 5900 Advanced Algorithms for Robust VLSI CAD, Spring 2009 Combinational Circuits.
An Improved “Soft” eFPGA Design and Implementation Strategy
Custom Computing Machines for the Set Covering Problem Paper Written By: Christian Plessl and Marco Platzner Swiss Federal Institute of Technology, 2002.
S3 INNOVATION ELECTRONICS. LESSON TITLE: ELECTRONICS Learning Intention: To understand when to use different types of logic gates Activity: Building own.
TOPIC : Introduction to Faults UNIT 2: Modeling and Simulation Module 1 : Logical faults due to physical faults.
FPGA Logic Cluster Design Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.
Architecture and algorithm for synthesizable embedded programmable logic core Noha Kafafi, Kimberly Bozman, Steven J. E. Wilton 2003 Field programmable.
Combinational Logic Analysis. Basic Combinational Logic Circuits AND-OR logic AND-OR logic AND-OR logic produces an SOP expression. AND-OR logic produces.
Logic Gates and Boolean Algebra Introduction to Logic II.
Proximity Optimization for Adaptive Circuit Design Ang Lu, Hao He, and Jiang Hu.
1 Double-Patterning Aware DSA Template Guided Cut Redistribution for Advanced 1-D Gridded Designs Zhi-Wen Lin and Yao-Wen Chang National Taiwan University.
On the Relation Between Simulation-based and SAT-based Diagnosis CMPE 58Q Giray Kömürcü Boğaziçi University.
Fault-Tolerant Resynthesis for Dual-Output LUTs Roy Lee 1, Yu Hu 1, Rupak Majumdar 2, Lei He 1 and Minming Li 3 1 Electrical Engineering Dept., UCLA 2.
Eng. Mai Z. Alyazji October, 2016
CSCI-100 Introduction to Computing
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Logic Gates.
CSE 370 – Winter Combinational Implementation - 1
Chapter 3 – Combinational Logic Design
KS4 Electricity – Electronic systems
Logic Gates.
Logic Gates AIM: To know the different types of logic gate
Presentation transcript:

Reap What You Sow: Spare Cells for Post-Silicon Metal Fix Kai-hui Chang, Igor L. Markov and Valeria Bertacco ISPD’08, Pages

Outline Introduction Introduction Background and Previous Work Background and Previous Work Cell Type Analysis Cell Type Analysis Placement Analysis Placement Analysis Experimental Results Experimental Results Conclusions Conclusions

Outline Introduction Introduction Background and Previous Work Background and Previous Work Cell Type Analysis Cell Type Analysis Placement Analysis Placement Analysis Experimental Results Experimental Results Conclusions Conclusions

Introduction Due to the recent increase in design complexity, more and more bugs escape pre-silicon validation and are found post- silicon. Respins are becoming more and more expensive, with mask costs approaching $10M per set.

Introduction A new technique to evaluate which type of cell is most useful to repair a given circuit. A novel spare-cell insertion methodology that covers both spare-cell selection and placement.

Introduction

Outline Introduction Introduction Background and Previous Work Background and Previous Work Cell Type Analysis Cell Type Analysis Placement Analysis Placement Analysis Experimental Results Experimental Results Conclusions Conclusions

Background and Previous Work Post-silicon metal fix techniques Errors observed after tape-out (post-silicon) can be classified into functional, electrical and manufacturing/yield problems. These problems often need to be resolved via metal fix.

Background and Previous Work Existing spare-cell insertion methods Spare-cell insertion is a design-dependent challenge whose solutions often rely on bug analysis from previous chips.

Outline Introduction Introduction Background and Previous Work Background and Previous Work Cell Type Analysis Cell Type Analysis Placement Analysis Placement Analysis Experimental Results Experimental Results Conclusions Conclusions

Cell Type Analysis Intuitively it seems that different circuit blocks in the design may benefit best from different types of spare cells, and in general, some types may be more useful than others. The paper developed a novel algorithm, called SimSynth, that evaluates quantitatively the usefulness of a specific cell type.

The SimSynth Technique The SimSynth algorithm relies on a pool of input vectors for the circuit that can either be provided by a high-level simulator or acquired through a random selection. For example, consider an AND gate with inputs A, B and output O. Given two input vectors (A, B) = (0, 0) and (0, 1), the simulated values of O are 0 and 1. The signatures of A, B and O are then 00,01 and 01, respectively.

The SimSynth Technique These signatures can be thought of as partial truth tables that exclude all controllability don’t-cares and they are the input to the SimSynth algorithm The algorithm’s output is the success rate to generate a signature that already exists in the design region.

The SimSynth Technique

To collect the signatures, we select a random wire, search for gates within 40μm from the driver of the wire, and then retrieve the signatures from the outputs of those gates to form a signature pool.

The SimSynth Technique SimSynth can also be used to determine spare-cell density. If the success rate is high, then the logic functions of the signals are similar, and generating a new signal that is close to any existing one should be easy.

Spare-Cell Density Formula 1 shows how to determine the spare-cell density Di for block Bi. S i : the average success rate for block B i S avg : the average success rate for all the blocks D all : the target overall spare-cell density P: a parameter that determines the impact of S i on D i and should be determined empirically

Empirical Results

Discussion Our empirical results suggest that AND, NAND, OR, NOR and INV are the most useful in general, while XOR is the least useful. But CMOS standard cells that implement INV, NAND and NOR are smaller than those for AND and OR gates, making INV, NAND and NOR preferable as spare cells due to their functional completeness.

Outline Introduction Introduction Background and Previous Work Background and Previous Work Cell Type Analysis Cell Type Analysis Placement Analysis Placement Analysis Experimental Results Experimental Results Conclusions Conclusions

Placement Analysis When errors occur too far from pre-placed spare cells, the required wire connections may be too long to be practical. The spare cells are often grouped into spare-cell islands and then placed on a uniform grid; however, it is also possible to uniformly distribute individual cells instead of grouped cell islands.

Placement Analysis A high-quality spare-cell placement should have minimal impact on important circuit parameters before metal fix to avoid increasing circuit delay or wirelength inadvertently and hurting design quality.

Placement Analysis

PostSpare placement should have minimal impact on important circuit parameters because spare cells are inserted after design placement. ClusterSpare placement may have larger impact on circuit parameters because the cell islands will act like macros and reduce the optimization that can be performed by the placer.

Outline Introduction Introduction Background and Previous Work Background and Previous Work Cell Type Analysis Cell Type Analysis Placement Analysis Placement Analysis Experimental Results Experimental Results Conclusions Conclusions

Experimental Results

Outline Introduction Introduction Background and Previous Work Background and Previous Work Cell Type Analysis Cell Type Analysis Placement Analysis Placement Analysis Experimental Results Experimental Results Conclusions Conclusions

Conclusions They proposed a new methodology that is more flexible than existing solutions and covers both spare-cell selection and placement. It can help determine the spare-cell density automatically—a problem that has not been previously addressed in the EDA literature.

The SimSynth Technique Typically, a new signal that fixes a functional error is only slightly different from an existing one because most of the circuit’s functions are already correct in post-silicon debugging. In general, more input vectors will bias the utility of spare-cell types toward fixing electrical errors because the generated signals will be closer to existing ones, while the selection will be biased toward functional errors when fewer vectors are used.

Discussion In summary, our results suggest that: Different types of designs or errors need different combinations of spare-cell types. The most useful types are simple ones such as INV, NAND and NOR, while more complex gates such as XOR and MUX2 are less useful.

Algorithm Overview