Ketan Patel, Igor Markov, John Hayes {knpatel, imarkov, University of Michigan Abstract Circuit reliability is an increasingly important.

Slides:



Advertisements
Similar presentations
ADDER, HALF ADDER & FULL ADDER
Advertisements

Matrix Multiplication To Multiply matrix A by matrix B: Multiply corresponding entries and then add the resulting products (1)(-1)+ (2)(3) Multiply each.
Copyright 2001, Agrawal & BushnellDay-1 AM-3 Lecture 31 Testing Analog & Digital Products Lecture 3: Fault Modeling n Why model faults? n Some real defects.
Quantum Phase Estimation using Multivalued Logic.
Quantum Phase Estimation using Multivalued Logic Vamsi Parasa Marek Perkowski Department of Electrical and Computer Engineering, Portland State University.
A Universal Operator Theoretic Framework for Quantum Fault Tolerance Yaakov S. Weinstein MITRE Quantum Information Science Group MITRE Quantum Error Correction.
Logic Simulation 4 Outline –Fault Simulation –Fault Models –Parallel Fault Simulation –Concurrent Fault Simulation Goal –Understand fault simulation problem.
4/25/2006 ELEC7250: Hill 1 Brad Hill ELEC 7250 Logic Simulator.
Spring 07, Feb 8 ELEC 7770: Advanced VLSI Design (Agrawal) 1 ELEC 7770 Advanced VLSI Design Spring 2007 Logic Equivalence Vishwani D. Agrawal James J.
High-Performance Simulation of Quantum Computation using QuIDDs George F. Viamontes, Manoj Rajagopalan, Igor L. Markov, and John P. Hayes Advanced Computer.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 51 Lecture 5 Fault Modeling n Why model faults? n Some real defects in VLSI and PCB n Common fault.
Engineering Models and Design Methods for Quantum State Machines.
Dirac Notation and Spectral decomposition Michele Mosca.
1 Jianwei Dai, Lei Wang, and Faquir Jain Department of Electrical and Computer Engineering University of Connecticut Analysis of Defect Tolerance in Molecular.
Anuj Dawar.
Copyright 2007 Koren & Krishna, Morgan-Kaufman Part.2.1 FAULT TOLERANT SYSTEMS Part 2 – Canonical.
Generalized Communication System: Error Control Coding Occurs In Right Column. 6.
1 Matrix Addition, C = A + B Add corresponding elements of each matrix to form elements of result matrix. Given elements of A as a i,j and elements of.
An Arbitrary Two-qubit Computation in 23 Elementary Gates or Less Stephen S. Bullock and Igor L. Markov University of Michigan Departments of Mathematics.
Quantum Counters Smita Krishnaswamy Igor L. Markov John P. Hayes.
Dirac Notation and Spectral decomposition
International Test Conference Charlotte, NC, Sep 30-Oct 2, 2003 Defect Tolerance at the End of the Roadmap Mahim Mishra and Seth C. Goldstein Carnegie.
|x1 |x1 (a) |x2 |x2 | x1 x2  y |y |x |x (b) | x  y |y
EE 587 SoC Design & Test Partha Pande School of EECS Washington State University
CSEP 590tv: Quantum Computing Dave Bacon June 29, 2005 Today’s Menu Administrivia Complex Numbers Bra’s Ket’s and All That Quantum Circuits.
Technical University Tallinn, ESTONIA Overview: Fault Simulation Overview about methods Low (gate) level methods Parallel fault simulation Deductive fault.
1 Fault-Tolerant Computing Systems #2 Hardware Fault Tolerance Pattara Leelaprute Computer Engineering Department Kasetsart University
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTES Fault Modeling.
Circuit, State Diagram, State Table
Capacity analysis of complex materials handling systems.
Soft Computing Lecture 18 Foundations of genetic algorithms (GA). Using of GA.
Ahsanul Haque *, Swarup Chandra *, Latifur Khan * and Michael Baron + * Department of Computer Science, University of Texas at Dallas + Department of Mathematical.
To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 5-1 1© 2006 by Prentice Hall, Inc. Upper Saddle River, NJ Module 5 Mathematical.
Software Measurement & Metrics
EE5393, Circuits, Computation, and Biology Computing with Probabilities 1,1,0,0,0,0,1,0 1,1,0,1,0,1,1,1 1,1,0,0,1,0,1,0 a = 6/8 c = 3/8 b = 4/8.
Fault Models, Fault Simulation and Test Generation Vishwani D. Agrawal Department of ECE, Auburn University Auburn, AL 36849, USA
© 2005 Prentice Hall1-1 Stumpf and Teague Object-Oriented Systems Analysis and Design with UML.
EE434 ASIC & Digital Systems Partha Pande School of EECS Washington State University
CPSC 873 John D. McGregor Session 9 Testing Vocabulary.
Software Quality Assurance SOFTWARE DEFECT. Defect Repair Defect Repair is a process of repairing the defective part or replacing it, as needed. For example,
CPSC 871 John D. McGregor Module 8 Session 1 Testing.
Unit 3 Matrix Arithmetic IT Disicipline ITD 1111 Discrete Mathematics & Statistics STDTLP 1 Unit 3 Matrix Arithmetic.
Jan. 26, 2001VLSI Test: Bushnell-Agrawal/Lecture 51 Lecture 5 Fault Modeling n Why model faults? n Some real defects in VLSI and PCB n Common fault models.
TOPIC : Introduction to Faults UNIT 2: Modeling and Simulation Module 1 : Logical faults due to physical faults.
Adding Algorithm Based Fault-Tolerance to BLIS Tyler Smith, Robert van de Geijn, Mikhail Smelyanskiy, Enrique Quintana-Ortí 1.
Technical University Tallinn, ESTONIA Overview: Fault Simulation Overview about methods Low (gate) level methods Parallel fault simulation Deductive fault.
Part.2.1 In The Name of GOD FAULT TOLERANT SYSTEMS Part 2 – Canonical Structures Chapter 2 – Hardware Fault Tolerance.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 51 Lecture 5 Fault Modeling n Why model faults? n Some real defects in VLSI and PCB n Common fault.
CPSC 372 John D. McGregor Module 8 Session 1 Testing.
Coverage Efficiency in Autonomous Robots With Emphasis on Simultaneous Localization and Mapping Mo Lu Computer Systems Lab Q2.
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.
ELE 523E COMPUTATIONAL NANOELECTRONICS
13.4 Product of Two Matrices
John D. McGregor Session 9 Testing Vocabulary
Matrix Operations.
Chapter 8 – Software Testing
Matrix Multiplication
Matrix Operations.
John D. McGregor Session 9 Testing Vocabulary
CPE/EE 428/528 VLSI Design II – Intro to Testing (Part 3)
John D. McGregor Session 9 Testing Vocabulary
Matrices Elements, Adding and Subtracting
MATRICES MATRIX OPERATIONS.
Bayesian Deep Learning on a Quantum Computer
Chapter 18 Testing Conventional Applications.
VLSI Testing Lecture 3: Fault Modeling
Stumpf and Teague Object-Oriented Systems Analysis and Design with UML
Matrix Addition, C = A + B Add corresponding elements of each matrix to form elements of result matrix. Given elements of A as ai,j and elements of B as.
ELE 523E COMPUTATIONAL NANOELECTRONICS
Stumpf and Teague Object-Oriented Systems Analysis and Design with UML
Presentation transcript:

Ketan Patel, Igor Markov, John Hayes {knpatel, imarkov, University of Michigan Abstract Circuit reliability is an increasingly important design consideration for modern logic circuits. To this end, our work focuses on the evaluation of circuit reliability under probabilistic gate-level fault models that can capture both soft errors, e.g., radiation-related, and spatially-uniform manufacturing defects. This basic task can, in principle, be used by synthesis procedures to select more reliable circuits to estimate yield for electronic nanotechnologies where high defect density is expected. We propose a matrix-based formalism to compute the error probability of the whole circuit based on probabilities of specific gate errors. This formalism is surprisingly related to that of quantum circuits, but also exhibits several new features. The numerical computation of error probabilities in large circuits runs into the same scalability problems as the simulation of quantum circuits. Therefore, we hope to adapt recent advances in quantum circuit simulation to the context of this work. Evaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models Component Interconnections Fault-tolerant Circuits Fault-tolerant circuits can be analyzed using our formalism. encoded inputs  columns in probabilistic transfer matrix corresponding to non-codewords eliminated encoded outputs  ideal transfer matrix modified to have multiple ones in each column, corresponding to each of the possible correct outputs Probabilistic Transfer Matrix Probabilistic transfer matrix row indices – represent outputs values column indices – represent inputs values Matrix elements capture pairwise transition probabilities Example: Probabilistic AND gate inputs output probability output is 1 when input is 10 Circuit Example Consider two circuits implementing the function b+ac Gate error probability (p) Output error probability Circuit (b) Circuit (a) abcabc acbacb (a)(b) INV OR (AND  AND)’ OR (AND  INV) (INV  INV  I 2 ) Relation to Quantum Simulation Ongoing Work Incorporate into circuit synthesis methods BDD-based methods to counter scalability issues  similar methods have been used for quantum simulation Software for automated circuit reliability analysis Connections to quantum computing Other formalism for evaluating circuit reliability Reliability analysis for special circuits structures The circuit reliability can be determined from its probabilistic transfer matrix: The probabilistic transfer matrix for a circuit can be determined from those of its gates, using operations corresponding to three basic methods of composition: serial, parallel and fanout connections. ABAB A B Parallel Connection A B Serial Connection BA Motivation Current fault models don’t address transient failures  Need probabilistic fault models Circuit reliability depends not only on faultiness of gates but also on circuit structure  Need method to incorporate circuit structure Probabilistic Fault Model Assume gates gives an incorrect output with some probability. Example: Probabilistic AND gate B’ is the prob. transfer matrix of component B with columns corresponding to invalid inputs removed with probability 1-p 1 with probability p ideal transfer matrix (I.e., no errors) circuit input probabilities (j,i)-th entry of probabilistic transfer matrix circuit error probability Quantum simulationOur formalism No fanoutFanout Square matricesRectangular matrices Complex, unitary matrices Real matrices Final step: measurement Final step: error probability calculation Quantum simulationOur formalism Gate operations Represented by matrices Serial connections Represented by matrix product Parallel connections Represented by tensor product Matrix sizeDoubly exponential Similarities Differences AB B’A Fanout Connection