Outline Fault Simulation
|
|
- Chester Greer
- 5 years ago
- Views:
Transcription
1 K.T. Tim Cheng, 4_fault_sim, v. Outline Fault Simulation Applications of fault simulation Fault coverage vs product quality Fault simulation scenarios Fault simulation algorithms Fault sampling K.T. Tim Cheng, 4_fault_sim, v. 2
2 What is the Fault Simulation Problem? Given : A circuit A test (sequence of test vectors) A fault model Determine: Fault coverage (the fraction of modeled faults detected) Undetected faults K.T. Tim Cheng, 4_fault_sim, v. 3 Applications of Fault Simulation Determine fault coverage of a given test sequence Fault coverage = # of detected faults total # of faults Measure of test quality Approximate defect coverage Defect coverage: the probability that the test sequence detects any physical defect in the ckt. Determine undetected faults for test generation K.T. Tim Cheng, 4_fault_sim, v. 4 2
3 Use of Fault Simulation in Test Generation System Verified design netlist Verification input stimuli Fault simulator Test vectors Modeled fault list Remove tested faults Test compactor Delete vectors Fault Low coverage? Adequate Stop Test generator Add vectors Ack: Bushnell and Agrawal, Essential of Electronic Testing, 2 K.T. Tim Cheng, 4_fault_sim, v. 5 Applications of Fault Simulation-Cont d Construct fault dictionary for diagnosis Use a fault simulator to compute & store the response for every fault If the output response of the circuit under test matches any of the response in the fault dictionary, the fault location is identified K.T. Tim Cheng, 4_fault_sim, v. 6 3
4 Yield & Defect Level Let: Y (yield) : probability that a manufactured circuit is defect-free DL (defect level) : probability of shipping a defective product d (defect coverage) : the defect coverage of the test used to check for manufacturing defects DL = - Y -d [ William & Brown, 98. Trans. on Computers] K.T. Tim Cheng, 4_fault_sim, v. 7 High Fault Coverage: Why? Y = manufacturing yield DL = defect level d = defect coverage DL = - Y -d Defect level Y =. Y =. Y =.25 Y = Y =.75 Y = Defect coverage (%) K.T. Tim Cheng, 4_fault_sim, v. 8 4
5 High Fault Coverage: Why? 25 2 Y =.3 Defect level (DPM) 5 Y =.5 Y = Defect coverage (%) Y =.5 Coverage Defect Level Too pessimistic!! K.T. Tim Cheng, 4_fault_sim, v. 9 Fault Coverage vs. Defect Coverage High fault coverage (measured for single stuck-at faults) is : necessary but not sufficient for high defect coverage. Also need: Parametric testing Delay-fault testing Bridging-fault testing Technology-specific-fault testing (e.g., CMOS stuck-open/-short faults) K.T. Tim Cheng, 4_fault_sim, v. 5
6 Fault Simulation Scenario Circuit model: mixed-level Mostly logic with some switch-level for high-impedance (Z) and bidirectional signals High-level models (memory, etc.) with pin faults Signal states: logic Two (, ) or three (,, X) states for purely Boolean logic circuits Four states (,, X, Z) for sequential MOS circuits Timing: Zero-delay for combinational and synchronous circuits Mostly unit-delay for circuits with feedback K.T. Tim Cheng, 4_fault_sim, v. Fault Simulation Scenario cont d Faults models: typically single-sa & transition faults Transistor (stuck-open/-short) fault and path-delay fault simulators are not in common use Equivalence fault collapsing of single SA faults is in common use (no dominance collapsing why?) CPU runtime and memory usage are major limitations for large ckts Fault-dropping - a fault once detected is dropped from consideration as more vectors are simulated; faultdropping may be suppressed for diagnosis Fault sampling - a random sample of faults is simulated when the circuit is large K.T. Tim Cheng, 4_fault_sim, v. 2 6
7 Fault Simulation Algorithms Serial Parallel Deductive Concurrent Parallel-pattern single-fault propagation Differential K.T. Tim Cheng, 4_fault_sim, v. 3 Serial Fault Simulation For every fault Modify the fault-free circuit to inject the fault Rerun logic simulation Compare the output response to a stored output for detection Easy to implement CPU time is large for big circuits But, to simulate N faults, the total fault simulation time is not N T T is logic (fault-free) simulation time of same test Why? K.T. Tim Cheng, 4_fault_sim, v. 4 7
8 Parallel Fault Simulation Compiled code simulation Exploits inherent parallelism of logic instructions Storage: one word per signal for binary simulation Multi-pass simulation Each pass simulates (w-) new faults w: the machine word length K.T. Tim Cheng, 4_fault_sim, v. 5 Parallel Fault Simulation - An Example Fault - free circuit Circuit with c stuck at Circuit with f stuck at Bit : 2 a b x c sa - e g d x f sa - K.T. Tim Cheng, 4_fault_sim, v. 6 8
9 Parallel Fault Simulation - Multiple Values Three signal values : {,, u } Two bits per signal encoding A A A u K.T. Tim Cheng, 4_fault_sim, v. 7 Word Operations for Basic Functions Two words per signal AND OR NOT x y z x y z X Z Z = X * Y Z = X * Y * bit-wise AND Z = X + Y Z = X + Y + bit-wise OR Z = X Z = X - bit-wise NOT K.T. Tim Cheng, 4_fault_sim, v. 8 9
10 Parallel Fault Simulation CPU increases with the number of faults Fixed low memory requirement Simulate many faulty circuits at once Easy to implement fixed-delay timing model Elements must have logical operation K.T. Tim Cheng, 4_fault_sim, v. 9 Deductive Fault Simulation One-pass simulation for all faults A list of faults attached to each signal by simulation Fault F in list L k F causes signal k be sensitized Derive rules to compute output fault list from input fault lists of a gate; rules depend on both gate type and input values K.T. Tim Cheng, 4_fault_sim, v. 2
11 Deductive Simulation - Examples A B Z Any fault causes an error at A or B (change A or B from to ) will cause Z to be erroneously. L Z = L A L B { Z s-a-} A B Z Any fault that causes A to be without changing B, will cause Z to be in error ; i.e Z = L Z = (L A L B ) { Z s-a-} = (L A -L B ) { Z s-a-} K.T. Tim Cheng, 4_fault_sim, v. 2 Deductive Fault Simulation - Rules Gate Z I: set of inputs c: controlling value i : inversion S: set of inputs with value c The fault list of Z: if S = φ then L Z = { L j } { Z s-a- (c i)} ---- () j I else L Z = { L j } - { L j } { Z s-a-(c i)} (2) j S j I-S () If no input has value c, any fault effect on any input propagates to the output. (2) If some inputs have value c, only a fault effect that affects all the inputs at c without affecting any of the inputs at c propagates to the output. K.T. Tim Cheng, 4_fault_sim, v. 22
12 Deductive Fault Simulation - An Example {a} a {b} b {b, c} c d L e = L a L c { e } = { a, b, c, e } e {b, d, f} {b, d} f L g = L e L f { g } = { a, c, e, g } g K.T. Tim Cheng, 4_fault_sim, v. 23 Deductive Fault Simulation - Algorithm Pre-processing: Levelize ckt from inputs to outputs Step : Read in a test vector Step 2: Perform logic simulation Step 3: Perform list intersection, inversion, union level by level from inputs towards outputs; Step 4: determine and drop detected faults Go to step K.T. Tim Cheng, 4_fault_sim, v. 24 2
13 Concurrent Fault Simulation (Ref: Ulrich & Baker, Computer 975) Requires good circuit simulation plus only those parts of a faulty circuit which differ from the good circuit Fault-free and all faulty circuits are simulated in one pass Record differences between a faulty circuit and the faultfree circuit Store the differences in lists (one list per gate) An element in the list of a gate iff the input/output values of the faulty circuit are different from the the fault-free values K.T. Tim Cheng, 4_fault_sim, v. 25 Concurrent Simulation - An Example a bo c e a b c d e f a g b c e d f g b d f K.T. Tim Cheng, 4_fault_sim, v. 26 3
14 Concurrent Fault Simulation - Cont d An element contains: Fault index Fault state Input values Output values Event-driven: events include value changes in both fault-free and faulty circuits. K.T. Tim Cheng, 4_fault_sim, v. 27 Concurrent Simulation - Convergence a => b => c => e => a b c d => => => e f => a => g b c e => d => f => g b d f K.T. Tim Cheng, 4_fault_sim, v. 28 4
15 Concurrent Simulation - Divergence b c a e a b c e g d f b d f a e g b d f K.T. Tim Cheng, 4_fault_sim, v. 29 Advantages and Disadvantages of Deductive & Concurrent Algorithms Advantage: Single-pass simulation for all faults Disadvantage: Large memory to record the status of all machines Dynamic memory, (linked lists) Evaluation overhead on the linked lists Performance overhead in memory management K.T. Tim Cheng, 4_fault_sim, v. 3 5
16 Parallel-Pattern Single-Fault Propagation (Waicukauski et al, ITC, 985) For combinational circuits only Single-fault propagation (serial fault simulation) Parallel-pattern evaluation (). Parallel fault-free simulation of a group of W vectors (2). Undetected faults are serially injected and the faulty values are computed in parallel for the same set of vectors (3). Propagation of the fault effects continues as long as faulty values different from the good values in at least vector K.T. Tim Cheng, 4_fault_sim, v. 3 Random Fault Sampling The computational requirements ( CPU & memory) of fault simulation increase with the number of simulated faults. Fault sampling: a technique that reduces the cost of fault simulation by simulating only a random sample of total faults Problem statement: to determine a sample size m<<m s.t. we can be confident (with a specified confidence level c) that the error in the estimated fault coverage is bounded by a given e max K.T. Tim Cheng, 4_fault_sim, v. 32 6
17 Fault Sampling Problem Formulation M: total number of collapsed faults M K: number of faults detected by the K evaluated test sequence T k m: number of faults randomly selected k: number of detected faults in m m Actual fault coverage : F = K/M Regard k as a random variable P k (m, M, K): the probability that T will detect k faults from a random sample of size m, given that it detects K faults from the entire set of M faults K.T. Tim Cheng, 4_fault_sim, v. 33 Fault Sampling Deriving the Formula P k (m, M, K) = It s hypergeometric distribution: K mean: μ k = m = mf M variance: σ k 2 = K M K k m k M m K K M m m M M M m mf M ( F ) K M k m K.T. Tim Cheng, 4_fault_sim, v. 34 7
18 Deriving the Formula Cont d For large M, it can be approximated by a normal distribution with mean μ k and standard deviation σ k The estimated fault coverage f: a random variable with normal distribution μ f = μ k /m = F σ 2 f = σ k2 /m 2 = (/m) F(-F) (-m/m) With a confidence level of 99.7%, the estimated fault coverage f [F-3σ f, F+3σ f ] e max =3σ f = m 3 F( F ) M m If m<<m, e max 3 F ( F ) m - independent of M!! K.T. Tim Cheng, 4_fault_sim, v. 35 Prediction Error As a Function of Fault Coverage and Sample Size Maximum error emax.7 m= m=.3 m= Fault coverage F K.T. Tim Cheng, 4_fault_sim, v. 36 8
19 Summary Fault Simulation Fault simulator is an essential for test development Fault simulation is a memory- and computationexpensive process Several efficient algorithms Parallel Deductive Concurrent Parallel-pattern single-fault propagation For large ckts, accuracy of random fault sampling only depends on sample size, and not on circuit size. The method could save substantial amount of CPU runtime and memory usage K.T. Tim Cheng, 4_fault_sim, v. 37 9
ECE 1767 University of Toronto
Applications Why Two Fault Simulators Never Agree General Techniques Parallel Pattern Simulation Inactive Fault Removal Critical Path Tracing Fault Sampling Statistical Fault Analysis ECE 767 Fault grading
More informationEECS 579: Logic and Fault Simulation. Simulation
EECS 579: Logic and Fault Simulation Simulation: Use of computer software models to verify correctness Fault Simulation: Use of simulation for fault analysis and ATPG Circuit description Input data for
More informationFault Modeling. 李昆忠 Kuen-Jong Lee. Dept. of Electrical Engineering National Cheng-Kung University Tainan, Taiwan. VLSI Testing Class
Fault Modeling 李昆忠 Kuen-Jong Lee Dept. of Electrical Engineering National Cheng-Kung University Tainan, Taiwan Class Fault Modeling Some Definitions Why Modeling Faults Various Fault Models Fault Detection
More informationVLSI Design Verification and Test Simulation CMPE 646. Specification. Design(netlist) True-value Simulator
Design Verification Simulation used for ) design verification: verify the correctness of the design and 2) test verification. Design verification: Response analysis Specification Design(netlist) Critical
More informationECE 407 Computer Aided Design for Electronic Systems. Simulation. Instructor: Maria K. Michael. Overview
407 Computer Aided Design for Electronic Systems Simulation Instructor: Maria K. Michael Overview What is simulation? Design verification Modeling Levels Modeling circuits for simulation True-value simulation
More informationTestability. Shaahin Hessabi. Sharif University of Technology. Adapted from the presentation prepared by book authors.
Testability Lecture 6: Logic Simulation Shaahin Hessabi Department of Computer Engineering Sharif University of Technology Adapted from the presentation prepared by book authors Slide 1 of 27 Outline What
More informationDictionary-Less Defect Diagnosis as Surrogate Single Stuck-At Faults
Dictionary-Less Defect Diagnosis as Surrogate Single Stuck-At Faults Chidambaram Alagappan and Vishwani D. Agrawal Department of Electrical and Computer Engineering Auburn University, Auburn, AL 36849,
More informationChapter 2 Fault Modeling
Chapter 2 Fault Modeling Jin-Fu Li Advanced Reliable Systems (ARES) Lab. Department of Electrical Engineering National Central University Jungli, Taiwan Outline Why Model Faults? Fault Models (Faults)
More informationLogic BIST. Sungho Kang Yonsei University
Logic BIST Sungho Kang Yonsei University Outline Introduction Basics Issues Weighted Random Pattern Generation BIST Architectures Deterministic BIST Conclusion 2 Built In Self Test Test/ Normal Input Pattern
More informationIntroduction to VLSI Testing
Introduction to 李昆忠 Kuen-Jong Lee Dept. of Electrical Engineering National Cheng-Kung University Tainan, Taiwan Class Problems to Think How are you going to test A 32 bit adder A 32 bit counter A 32Mb
More informationLecture 5 Fault Modeling
Lecture 5 Fault Modeling Why model faults? Some real defects in VLSI and PCB Common fault models Stuck-at faults Single stuck-at faults Fault equivalence Fault dominance and checkpoint theorem Classes
More informationECE 3060 VLSI and Advanced Digital Design. Testing
ECE 3060 VLSI and Advanced Digital Design Testing Outline Definitions Faults and Errors Fault models and definitions Fault Detection Undetectable Faults can be used in synthesis Fault Simulation Observability
More informationFault Tolerant Computing CS 530 Fault Modeling. Yashwant K. Malaiya Colorado State University
CS 530 Fault Modeling Yashwant K. Malaiya Colorado State University 1 Objectives The number of potential defects in a unit under test is extremely large. A fault-model presumes that most of the defects
More informationLecture 7: Logic design. Combinational logic circuits
/24/28 Lecture 7: Logic design Binary digital circuits: Two voltage levels: and (ground and supply voltage) Built from transistors used as on/off switches Analog circuits not very suitable for generic
More informationLecture on Memory Test Memory complexity Memory fault models March test algorithms Summary
Lecture on Memory Test Memory complexity Memory fault models March test algorithms Summary Extracted from Agrawal & Bushnell VLSI Test: Lecture 15 1 % of chip area Importance of memories Memories dominate
More informationFAULT MODELING. Chapter Defects, Errors, and Faults
Chapter 4 FAULT MODELING... The extreme difficulty of obtaining solutions by conventional mathematical analysis has led in the past to the use of highly unrealistic models simply because they led to equations
More informationSingle Stuck-At Fault Model Other Fault Models Redundancy and Untestable Faults Fault Equivalence and Fault Dominance Method of Boolean Difference
Single Stuck-At Fault Model Other Fault Models Redundancy and Untestable Faults Fault Equivalence and Fault Dominance Method of Boolean Difference Copyright 1998 Elizabeth M. Rudnick 1 Modeling the effects
More informationFault Modeling. Fault Modeling Outline
Fault Modeling Outline Single Stuck-t Fault Model Other Fault Models Redundancy and Untestable Faults Fault Equivalence and Fault Dominance Method of oolean Difference Copyright 1998 Elizabeth M. Rudnick
More informationDigital Logic. CS211 Computer Architecture. l Topics. l Transistors (Design & Types) l Logic Gates. l Combinational Circuits.
CS211 Computer Architecture Digital Logic l Topics l Transistors (Design & Types) l Logic Gates l Combinational Circuits l K-Maps Figures & Tables borrowed from:! http://www.allaboutcircuits.com/vol_4/index.html!
More informationHardware testing and design for testability. EE 3610 Digital Systems
EE 3610: Digital Systems 1 Hardware testing and design for testability Introduction A Digital System requires testing before and after it is manufactured 2 Level 1: behavioral modeling and test benches
More informationSTATISTICAL FAULT SIMULATION.
STATISTICAL FAULT SIMULATION. JINS DAVIS ALEXANDER, GRADUATE STUDENT, AUBURN UNIVERSITY. ABSTRACT: Fault simulation is used for the development or evaluation of manufacturing tests. However with the increase
More informationDepartment of Electrical and Computer Engineering University of Wisconsin Madison. Fall Midterm Examination CLOSED BOOK
Department of Electrical and Computer Engineering University of Wisconsin Madison ECE 553: Testing and Testable Design of Digital Systems Fall 203-204 Midterm Examination CLOSED OOK Kewal K. Saluja Date:
More informationLatches. October 13, 2003 Latches 1
Latches The second part of CS231 focuses on sequential circuits, where we add memory to the hardware that we ve already seen. Our schedule will be very similar to before: We first show how primitive memory
More informationIHS 3: Test of Digital Systems R.Ubar, A. Jutman, H-D. Wuttke
IHS 3: Test of Digital Systems R.Ubar, A. Jutman, H-D. Wuttke Integrierte Hard- und Softwaresysteme RT-Level Design data path and control path on RT-level RT level simulation Functional units (F1,..,F4)
More informationLecture 14: State Tables, Diagrams, Latches, and Flip Flop
EE210: Switching Systems Lecture 14: State Tables, Diagrams, Latches, and Flip Flop Prof. YingLi Tian Nov. 6, 2017 Department of Electrical Engineering The City College of New York The City University
More informationModels for representing sequential circuits
Sequential Circuits Models for representing sequential circuits Finite-state machines (Moore and Mealy) Representation of memory (states) Changes in state (transitions) Design procedure State diagrams
More informationDictionary-Less Defect Diagnosis as Real or Surrogate Single Stuck-At Faults. Chidambaram Alagappan
Dictionary-Less Defect Diagnosis as Real or Surrogate Single Stuck-At Faults by Chidambaram Alagappan A thesis submitted to the Graduate Faculty of Auburn University in partial fulfillment of the requirements
More informationDepartment of Electrical and Computer Engineering University of Wisconsin Madison. Fall Final Examination
Department of Electrical and Computer Engineering University of Wisconsin Madison ECE 553: Testing and Testable Design of Digital Systems Fall 2013-2014 Final Examination CLOSED BOOK Kewal K. Saluja Date:
More informationPredicting IC Defect Level using Diagnosis
2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising
More informationLOGIC CIRCUITS. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D.
Basic Experiment and Design of Electronics LOGIC CIRCUITS Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Digital IC packages TTL (transistor-transistor
More informationCSE370: Introduction to Digital Design
CSE370: Introduction to Digital Design Course staff Gaetano Borriello, Brian DeRenzi, Firat Kiyak Course web www.cs.washington.edu/370/ Make sure to subscribe to class mailing list (cse370@cs) Course text
More informationA Compiled-Code Parallel Pattern Logic Simulator With Inertial Delay Model
JOURNAL OF INFORMATION PARALLEL PATTERN SCIENCE LOGIC AND ENGINEERING SIMULATOR WITH 15, 885-897 INERTIAL (1999) DELAY MODEL 885 A Compiled-Code Parallel Pattern Logic Simulator With Inertial Delay Model
More informationFault Tolerant Computing CS 530 Fault Modeling
CS 53 Fault Modeling Yashwant K. Malaiya Colorado State University Fault Modeling Why fault modeling? Stuck-at / fault model The single fault assumption Bridging and delay faults MOS transistors and CMOS
More informationEGFC: AN EXACT GLOBAL FAULT COLLAPSING TOOL FOR COMBINATIONAL CIRCUITS
EGFC: AN EXACT GLOBAL FAULT COLLAPSING TOOL FOR COMBINATIONAL CIRCUITS Hussain Al-Asaad Department of Electrical & Computer Engineering University of California One Shields Avenue, Davis, CA 95616-5294
More informationDepartment of Electrical and Computer Engineering University of Wisconsin Madison. Fall Midterm Examination CLOSED BOOK
Department of Electrical and Computer Engineering University of Wisconsin Madison ECE 553: Testing and Testable Design of Digital Systems Fall 2014-2015 Midterm Examination CLOSED BOOK Kewal K. Saluja
More informationCOE 202: Digital Logic Design Sequential Circuits Part 3. Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:
COE 202: Digital Logic Design Sequential Circuits Part 3 Dr. Ahmad Almulhem Email: ahmadsm AT kfupm Phone: 860-7554 Office: 22-324 Objectives Important Design Concepts State Reduction and Assignment Design
More informationMethodology to combine Formal and Fault simulator to measure safety metrics
Methodology to combine Formal and Fault simulator to measure safety metrics Jain Gaurav, Infineon Technologies AP Pte LTD, Singapore Kadambi Ranga, Infineon Technologies AP Pte LTD, Singapore Bandlamudi
More informationCMPE12 - Notes chapter 1. Digital Logic. (Textbook Chapter 3)
CMPE12 - Notes chapter 1 Digital Logic (Textbook Chapter 3) Transistor: Building Block of Computers Microprocessors contain TONS of transistors Intel Montecito (2005): 1.72 billion Intel Pentium 4 (2000):
More informationCombinational Logic. Mantıksal Tasarım BBM231. section instructor: Ufuk Çelikcan
Combinational Logic Mantıksal Tasarım BBM23 section instructor: Ufuk Çelikcan Classification. Combinational no memory outputs depends on only the present inputs expressed by Boolean functions 2. Sequential
More informationEECS 579: Test Generation 4. Test Generation System
EECS 579: Test Generation 4 Other Combinational ATPG Algorithms SOCRATES Structure-Oriented Cost-Reducing Automatic TESt pattern generation [Schultz et al. 988] An ATPG system not just a test generation
More informationSample Test Paper - I
Scheme G Sample Test Paper - I Course Name : Computer Engineering Group Marks : 25 Hours: 1 Hrs. Q.1) Attempt any THREE: 09 Marks a) Define i) Propagation delay ii) Fan-in iii) Fan-out b) Convert the following:
More informationDesign for Testability
Design for Testability Outline Ad Hoc Design for Testability Techniques Method of test points Multiplexing and demultiplexing of test points Time sharing of I/O for normal working and testing modes Partitioning
More informationCOSC 243. Introduction to Logic And Combinatorial Logic. Lecture 4 - Introduction to Logic and Combinatorial Logic. COSC 243 (Computer Architecture)
COSC 243 Introduction to Logic And Combinatorial Logic 1 Overview This Lecture Introduction to Digital Logic Gates Boolean algebra Combinatorial Logic Source: Chapter 11 (10 th edition) Source: J.R. Gregg,
More informationSoftware Engineering 2DA4. Slides 8: Multiplexors and More
Software Engineering 2DA4 Slides 8: Multiplexors and More Dr. Ryan Leduc Department of Computing and Software McMaster University Material based on S. Brown and Z. Vranesic, Fundamentals of Digital Logic
More informationDesign for Testability
Design for Testability Outline Ad Hoc Design for Testability Techniques Method of test points Multiplexing and demultiplexing of test points Time sharing of I/O for normal working and testing modes Partitioning
More informationOutline - BIST. Why BIST? Memory BIST Logic BIST pattern generator & response analyzer Scan-based BIST architecture. K.T. Tim Cheng 08_bist, v1.
1 Outline - BIST Why BIST? Memory BIST Logic BIST pattern generator & response analyzer Scan-based BIST architecture 2 Why Built-In Self Test? TYPES On-Line Self-Test (Concurrent Checking) Functional Self-Test
More informationRealization of 2:4 reversible decoder and its applications
Realization of 2:4 reversible decoder and its applications Neeta Pandey n66pandey@rediffmail.com Nalin Dadhich dadhich.nalin@gmail.com Mohd. Zubair Talha zubair.talha2010@gmail.com Abstract In this paper
More informationSystems I: Computer Organization and Architecture
Systems I: Computer Organization and Architecture Lecture 6 - Combinational Logic Introduction A combinational circuit consists of input variables, logic gates, and output variables. The logic gates accept
More informationPARITY BASED FAULT DETECTION TECHNIQUES FOR S-BOX/ INV S-BOX ADVANCED ENCRYPTION SYSTEM
PARITY BASED FAULT DETECTION TECHNIQUES FOR S-BOX/ INV S-BOX ADVANCED ENCRYPTION SYSTEM Nabihah Ahmad Department of Electronic Engineering, Faculty of Electrical and Electronic Engineering, Universiti
More informationChapter 7. Sequential Circuits Registers, Counters, RAM
Chapter 7. Sequential Circuits Registers, Counters, RAM Register - a group of binary storage elements suitable for holding binary info A group of FFs constitutes a register Commonly used as temporary storage
More informationAdders, subtractors comparators, multipliers and other ALU elements
CSE4: Components and Design Techniques for Digital Systems Adders, subtractors comparators, multipliers and other ALU elements Instructor: Mohsen Imani UC San Diego Slides from: Prof.Tajana Simunic Rosing
More informationVLSI Physical Design Prof. Indranil Sengupta Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur
VLSI Physical Design Prof. Indranil Sengupta Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture - 54 Design for Testability So, in the last lecture we talked
More informationCOE 202: Digital Logic Design Sequential Circuits Part 3. Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:
COE 202: Digital Logic Design Sequential Circuits Part 3 Dr. Ahmad Almulhem Email: ahmadsm AT kfupm Phone: 860-7554 Office: 22-324 Objectives State Reduction and Assignment Design of Synchronous Sequential
More informationSynchronous Sequential Circuit Design. Dr. Ehab A. H. AL-Hialy Page 1
Synchronous Sequential Circuit Design Dr. Ehab A. H. AL-Hialy Page Motivation Analysis of a few simple circuits Generalizes to Synchronous Sequential Circuits (SSC) Outputs are Function of State (and Inputs)
More informationECE-470 Digital Design II Memory Test. Memory Cells Per Chip. Failure Mechanisms. Motivation. Test Time in Seconds (Memory Size: n Bits) Fault Types
ECE-470 Digital Design II Memory Test Motivation Semiconductor memories are about 35% of the entire semiconductor market Memories are the most numerous IPs used in SOC designs Number of bits per chip continues
More informationLOGIC CIRCUITS. Basic Experiment and Design of Electronics
Basic Experiment and Design of Electronics LOGIC CIRCUITS Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Outline Combinational logic circuits Output
More informationWITH increasing complexity in systems design from increased
150 IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT, VOL. 51, NO. 1, FEBRUARY 2001 Data Compression in Space Under Generalized Mergeability Based on Concepts of Cover Table and Frequency Ordering
More informationSelf-Timed is Self-Checking
Self-Timed is Self-Checing Ilana David 1, Ran Ginosar 1, 2, and Michael Yoeli 2 1 Department of Electrical Engineering 2 Department of Computer Science Technion - Israel Institute of Technology Haifa 32000
More informationMAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified)
WINTER 17 EXAMINATION Subject Name: Digital Techniques Model Answer Subject Code: 17333 Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given
More informationon candidate s understanding. 7) For programming language papers, credit may be given to any other program based on equivalent concept.
WINTER 17 EXAMINATION Subject Name: Digital Techniques Model Answer Subject Code: 17333 Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given
More informationFundamentals of Digital Design
Fundamentals of Digital Design Digital Radiation Measurement and Spectroscopy NE/RHP 537 1 Binary Number System The binary numeral system, or base-2 number system, is a numeral system that represents numeric
More informationSequential Logic. Handouts: Lecture Slides Spring /27/01. L06 Sequential Logic 1
Sequential Logic Handouts: Lecture Slides 6.4 - Spring 2 2/27/ L6 Sequential Logic Roadmap so far Fets & voltages Logic gates Combinational logic circuits Sequential Logic Voltage-based encoding V OL,
More informationTest Pattern Generator for Built-in Self-Test using Spectral Methods
Test Pattern Generator for Built-in Self-Test using Spectral Methods Alok S. Doshi and Anand S. Mudlapur Auburn University 2 Dept. of Electrical and Computer Engineering, Auburn, AL, USA doshias,anand@auburn.edu
More informationSynchronous Sequential Circuit Design. Digital Computer Design
Synchronous Sequential Circuit Design Digital Computer Design Races and Instability Combinational logic has no cyclic paths and no races If inputs are applied to combinational logic, the outputs will always
More informationTestability of SPP Three-Level Logic Networks
Testability of SPP Three-Level Logic Networks Valentina Ciriani Anna Bernasconi Rolf Drechsler Department of Computer Science University of Pisa 561 Pisa, Italy {ciriani, annab}@di.unipi.it Institute of
More information課程名稱 : 數位邏輯設計 P-1/ /6/11
課程名稱 : 數位邏輯設計 P-1/55 2012/6/11 Textbook: Digital Design, 4 th. Edition M. Morris Mano and Michael D. Ciletti Prentice-Hall, Inc. 教師 : 蘇慶龍 INSTRUCTOR : CHING-LUNG SU E-mail: kevinsu@yuntech.edu.tw Chapter
More informationIntro To Digital Logic
Intro To Digital Logic 1 Announcements... Project 2.2 out But delayed till after the midterm Midterm in a week Covers up to last lecture + next week's homework & lab Nick goes "H-Bomb of Justice" About
More informationIntroduction EE 224: INTRODUCTION TO DIGITAL CIRCUITS & COMPUTER DESIGN. Lecture 6: Sequential Logic 3 Registers & Counters 5/9/2010
EE 224: INTROUCTION TO IGITAL CIRCUITS & COMPUTER ESIGN Lecture 6: Sequential Logic 3 Registers & Counters 05/10/2010 Avinash Kodi, kodi@ohio.edu Introduction 2 A Flip-Flop stores one bit of information
More informationDelay Testing from the Ivory Tower to Tools in the Workshop
Delay Testing from the Ivory Tower to Tools in the Workshop Einar Johan Aas Department of Electronics and Telecommunications, NTNU Nordic Test Forum, Tallinn, 25. November 2008 Name, title of the presentation
More informationNon-Invasive Pre-Bond TSV Test Using Ring Oscillators and Multiple Voltage Levels
Non-Invasive Pre-Bond TSV Test Using Ring Oscillators and Multiple Voltage Levels Sergej Deutsch and Krishnendu Chakrabarty Duke University Durham, NC 27708, USA Abstract Defects in TSVs due to fabrication
More informationCh 7. Finite State Machines. VII - Finite State Machines Contemporary Logic Design 1
Ch 7. Finite State Machines VII - Finite State Machines Contemporary Logic esign 1 Finite State Machines Sequential circuits primitive sequential elements combinational logic Models for representing sequential
More informationSequential Logic Circuits
Chapter 4 Sequential Logic Circuits 4 1 The defining characteristic of a combinational circuit is that its output depends only on the current inputs applied to the circuit. The output of a sequential circuit,
More informationCMSC 313 Lecture 15 Good-bye Assembly Language Programming Overview of second half on Digital Logic DigSim Demo
CMSC 33 Lecture 5 Good-bye ssembly Language Programming Overview of second half on Digital Logic DigSim Demo UMC, CMSC33, Richard Chang Good-bye ssembly Language What a pain! Understand
More informationLecture 17: Designing Sequential Systems Using Flip Flops
EE210: Switching Systems Lecture 17: Designing Sequential Systems Using Flip Flops Prof. YingLi Tian April 11, 2019 Department of Electrical Engineering The City College of New York The City University
More informationSynchronous Sequential Logic
1 IT 201 DIGITAL SYSTEMS DESIGN MODULE4 NOTES Synchronous Sequential Logic Sequential Circuits - A sequential circuit consists of a combinational circuit and a feedback through the storage elements in
More informationBoolean Algebra, Gates and Circuits
Boolean Algebra, Gates and Circuits Kasper Brink November 21, 2017 (Images taken from Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc.) Outline Last week: Von
More informationPGT104 Digital Electronics. PGT104 Digital Electronics
1 Part 6 Sequential Logic ircuits Disclaimer: Most of the contents (if not all) are extracted from resources available for Digital Fundamentals 10 th Edition 2 Basic Shift Register Operations A shift register
More informationSynchronous Sequential Circuit
Synchronous Sequential Circuit The change of internal state occurs in response to the synchronized clock pulses. Data are read during the clock pulse (e.g. rising-edge triggered) It is supposed to wait
More informationTransition Faults Detection in Bit Parallel Multipliers over GF(2 m )
Transition Faults Detection in Bit Parallel Multipliers over GF( m ) Hafizur Rahaman Bengal Engineering & Science University, Shibpur Howrah-73, India rahaman_h@it.becs.ac.in Jimson Mathew Computer Science
More informationMemory Elements I. CS31 Pascal Van Hentenryck. CS031 Lecture 6 Page 1
Memory Elements I CS31 Pascal Van Hentenryck CS031 Lecture 6 Page 1 Memory Elements (I) Combinational devices are good for computing Boolean functions pocket calculator Computers also need to remember
More informationLecture 8: Sequential Networks and Finite State Machines
Lecture 8: Sequential Networks and Finite State Machines CSE 140: Components and Design Techniques for Digital Systems Spring 2014 CK Cheng, Diba Mirza Dept. of Computer Science and Engineering University
More informationChapter 5. Digital Design and Computer Architecture, 2 nd Edition. David Money Harris and Sarah L. Harris. Chapter 5 <1>
Chapter 5 Digital Design and Computer Architecture, 2 nd Edition David Money Harris and Sarah L. Harris Chapter 5 Chapter 5 :: Topics Introduction Arithmetic Circuits umber Systems Sequential Building
More information3 Logic Function Realization with MSI Circuits
3 Logic Function Realization with MSI Circuits Half adder A half-adder is a combinational circuit with two binary inputs (augund and addend bits) and two binary outputs (sum and carry bits). It adds the
More informationStop Watch (System Controller Approach)
Stop Watch (System Controller Approach) Problem Design a stop watch that can measure times taken for two events Inputs CLK = 6 Hz RESET: Asynchronously reset everything X: comes from push button First
More information5. Sequential Logic x Computation Structures Part 1 Digital Circuits. Copyright 2015 MIT EECS
5. Sequential Logic 6.004x Computation Structures Part 1 igital Circuits Copyright 2015 MIT EECS 6.004 Computation Structures L5: Sequential Logic, Slide #1 Something We Can t Build (Yet) What if you were
More informationTest Generation for Designs with Multiple Clocks
39.1 Test Generation for Designs with Multiple Clocks Xijiang Lin and Rob Thompson Mentor Graphics Corp. 8005 SW Boeckman Rd. Wilsonville, OR 97070 Abstract To improve the system performance, designs with
More informationIntroduction to Computer Engineering. CS/ECE 252, Fall 2012 Prof. Guri Sohi Computer Sciences Department University of Wisconsin Madison
Introduction to Computer Engineering CS/ECE 252, Fall 2012 Prof. Guri Sohi Computer Sciences Department University of Wisconsin Madison Chapter 3 Digital Logic Structures Slides based on set prepared by
More informationSUPERB: Simulator Utilizing Parallel Evaluation of Resistive Bridges
SUPERB: Simulator Utilizing Parallel Evaluation of Resistive Bridges PIET ENGELKE Albert-Ludwigs-University, Freiburg BERND BECKER Albert-Ludwigs-University, Freiburg MICHEL RENOVELL LIRMM UMII, Montpellier
More informationRuntime Mechanisms for Leakage Current Reduction in CMOS VLSI Circuits
Runtime Mechanisms for Leakage Current Reduction in CMOS VLSI Circuits Afshin Abdollahi University of Southern California Farzan Fallah Fuitsu Laboratories of America Massoud Pedram University of Southern
More informationUMBC. At the system level, DFT includes boundary scan and analog test bus. The DFT techniques discussed focus on improving testability of SAFs.
Overview Design for testability(dft) makes it possible to: Assure the detection of all faults in a circuit. Reduce the cost and time associated with test development. Reduce the execution time of performing
More informationESE570 Spring University of Pennsylvania Department of Electrical and System Engineering Digital Integrated Cicruits AND VLSI Fundamentals
University of Pennsylvania Department of Electrical and System Engineering Digital Integrated Cicruits AND VLSI Fundamentals ESE570, Spring 017 Final Wednesday, May 3 4 Problems with point weightings shown.
More informationDigital Control of Electric Drives
Digital Control of Electric Drives Logic Circuits - equential Description Form, Finite tate Machine (FM) Czech Technical University in Prague Faculty of Electrical Engineering Ver.. J. Zdenek 27 Logic
More informationIntegrated Circuits & Systems
Federal University of Santa Catarina Center for Technology Computer Science & Electronics Engineering Integrated Circuits & Systems INE 5442 Lecture 18 CMOS Sequential Circuits - 1 guntzel@inf.ufsc.br
More informationLogic Synthesis and Verification
Logic Synthesis and Verification Jie-Hong Roland Jiang 江介宏 Department of Electrical Engineering National Taiwan University Fall Timing Analysis & Optimization Reading: Logic Synthesis in a Nutshell Sections
More informationLecture 22 Chapters 3 Logic Circuits Part 1
Lecture 22 Chapters 3 Logic Circuits Part 1 LC-3 Data Path Revisited How are the components Seen here implemented? 5-2 Computing Layers Problems Algorithms Language Instruction Set Architecture Microarchitecture
More informationMemory, Latches, & Registers
Memory, Latches, & Registers 1) Structured Logic Arrays 2) Memory Arrays 3) Transparent Latches 4) How to save a few bucks at toll booths 5) Edge-triggered Registers L13 Memory 1 General Table Lookup Synthesis
More informationDigital Electronics Part 1: Binary Logic
Digital Electronics Part 1: Binary Logic Electronic devices in your everyday life What makes these products examples of electronic devices? What are some things they have in common? 2 How do electronics
More informationChapter 4. Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. elements. Dr.
Chapter 4 Dr. Panos Nasiopoulos Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. Sequential: In addition, they include storage elements Combinational
More informationChapter 4. Sequential Logic Circuits
Chapter 4 Sequential Logic Circuits 1 2 Chapter 4 4 1 The defining characteristic of a combinational circuit is that its output depends only on the current inputs applied to the circuit. The output of
More informationS No. Questions Bloom s Taxonomy Level UNIT-I
GROUP-A (SHORT ANSWER QUESTIONS) S No. Questions Bloom s UNIT-I 1 Define oxidation & Classify different types of oxidation Remember 1 2 Explain about Ion implantation Understand 1 3 Describe lithography
More information