Final Exam: Graduate Course { VLSI Testing. 1. Please read all problems before starting your answers. Problems can be answered

Similar documents
Design for Testability

Design for Testability

Department of Electrical and Computer Engineering University of Wisconsin Madison. Fall Final Examination

UMBC. At the system level, DFT includes boundary scan and analog test bus. The DFT techniques discussed focus on improving testability of SAFs.

VLSI Physical Design Prof. Indranil Sengupta Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur

Department of Electrical and Computer Engineering University of Wisconsin Madison. Fall Midterm Examination CLOSED BOOK

VLSI System Testing. Testability Measures

Fault Modeling. Fault Modeling Outline

ECE20B Final Exam, 200 Point Exam Closed Book, Closed Notes, Calculators Not Allowed June 12th, Name

Department of Electrical and Computer Engineering University of Wisconsin Madison. Fall Midterm Examination CLOSED BOOK

Single Stuck-At Fault Model Other Fault Models Redundancy and Untestable Faults Fault Equivalence and Fault Dominance Method of Boolean Difference

IHS 3: Test of Digital Systems R.Ubar, A. Jutman, H-D. Wuttke

ECE 3060 VLSI and Advanced Digital Design. Testing

Hardware testing and design for testability. EE 3610 Digital Systems

Faculty of Engineering. FINAL EXAMINATION FALL 2008 (December2008) ANSWER KEY

CMSC 313 Lecture 19 Homework 4 Questions Combinational Logic Components Programmable Logic Arrays Introduction to Circuit Simplification

ECE 512 Digital System Testing and Design for Testability. Model Solutions for Assignment #3

Overview. Multiplexor. cs281: Introduction to Computer Systems Lab02 Basic Combinational Circuits: The Mux and the Adder

Design For Testability Properties of AND/XOR Networks. Andisheh Sarabi, Marek A. Perkowski. Portland State University

12/31/2010. Overview. 10-Combinational Circuit Design Text: Unit 8. Limited Fan-in. Limited Fan-in. Limited Fan-in. Limited Fan-in

Show that the dual of the exclusive-or is equal to its compliment. 7

LOGIC GATES (PRACTICE PROBLEMS)

S No. Questions Bloom s Taxonomy Level UNIT-I

Introduction to VLSI Testing

Outline Automatic Test Pattern Generation

COSC3330 Computer Architecture Lecture 2. Combinational Logic

UNIVERSITY OF CALIFORNIA College of Engineering Department of Electrical Engineering and Computer Sciences. Professor Oldham Fall 1999

Test Pattern Generator for Built-in Self-Test using Spectral Methods

VLSI Design I. Defect Mechanisms and Fault Models

CPE100: Digital Logic Design I

ESE 570: Digital Integrated Circuits and VLSI Fundamentals

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING QUESTION BANK

Fault Modeling. 李昆忠 Kuen-Jong Lee. Dept. of Electrical Engineering National Cheng-Kung University Tainan, Taiwan. VLSI Testing Class

Built-In Test Generation for Synchronous Sequential Circuits

CARLETON UNIVERSITY Final EXAMINATION April 16, 2003

Testability Measures controllability observability Controllability Observability

ELEC Digital Logic Circuits Fall 2014 Logic Minimization (Chapter 3)

CARLETON UNIVERSITY Final rev EXAMINATION Fri, April 22, 2005, 14:00

Switching Circuits & Logic Design

ELEC Digital Logic Circuits Fall 2015 Logic Minimization (Chapter 3)

DIAGNOSIS OF FAULT IN TESTABLE REVERSIBLE SEQUENTIAL CIRCUITS USING MULTIPLEXER CONSERVATIVE QUANTUM DOT CELLULAR AUTOMATA

Written reexam with solutions for IE1204/5 Digital Design Monday 14/

Realization of programmable logic array using compact reversible logic gates 1

Chapter # 3: Multi-Level Combinational Logic

Models for representing sequential circuits

Lecture 8: Sequential Multipliers

CARLETON UNIVERSITY Final EXAMINATION April 13, 2009: 14:00

Structural Delay Testing Under Restricted Scan of Latch-based Pipelines with Time Borrowing

15.1 Elimination of Redundant States

ESE 570: Digital Integrated Circuits and VLSI Fundamentals

Please read these instructions carefully, but do not open the question paper until you are told that you may do so.

Self-checking Synchronous FSM Network Design with Low Overhead

Fault Equivalence, Dominance & Collapsing. Fault Equivalence

(a) For e/0, two vectors, abc = {011, 111} can detect it. Thus. (b) For e/1, one vector, abc = 010 can detect it. Thus

Chapter 6 Testability Analysis

Logic BIST. Sungho Kang Yonsei University

Sample Test Paper - I

ECE 212H1F Circuit Analysis October 30, :10-19: Reza Iravani 02 Reza Iravani 03 Piero Triverio. (Non-programmable Calculators Allowed)

Lecture 5 Fault Modeling

Computer Architecture 10. Fast Adders

Chapter 2. Introduction. Chapter 2 :: Topics. Circuits. Nodes. Circuit elements. Introduction

L9: Galois Fields. Reading material

Transition Faults Detection in Bit Parallel Multipliers over GF(2 m )

Name. ECE-200 Intelligent Systems

Chapter 4 Optimized Implementation of Logic Functions

CPE100: Digital Logic Design I

Lecture 16: Circuit Pitfalls

Philadelphia University Student Name: Student Number:

UNIVERSITI TENAGA NASIONAL. College of Information Technology

Lecture 8: Combinational Circuits

Digital Logic & Computer Design CS Professor Dan Moldovan Spring Copyright 2007 Elsevier 2-<101>

INTEGRATED CIRCUITS. For a complete data sheet, please also download:

6 Simplification of. Boolean Functions

12 - The Tie Set Method

ENGR4300 Fall 2005 Test 3A. Name. Section. Question 1 (25 points) Question 2 (25 points) Question 3 (25 points) Question 4 (25 points)

A NOVEL PRESENTATION OF PERES GATE (PG) IN QUANTUM-DOT CELLULAR AUTOMATA(QCA)

Digital Logic & Computer Design CS Professor Dan Moldovan Spring 2010

VLSI. Faculty. Srikanth

University of Florida EEL 3701 Fall 2014 Dr. Eric. M. Schwartz Department of Electrical & Computer Engineering Wednesday, 15 October 2014

Fault Tolerant Computing CS 530 Fault Modeling. Yashwant K. Malaiya Colorado State University

Problem Set 9 Solutions

Lecture 9: Combinational Circuit Design

CHAPTER * 6-2. a) 3-input NAND gate b) 4-input NOR gate * Pearson Education, Inc. a) F = (A + B) C D. b) G = (A + B) (C + D)

S.E. Sem. III [ETRX] Digital Circuit Design. t phl. Fig.: Input and output voltage waveforms to define propagation delay times.

CMPEN 411 VLSI Digital Circuits Spring 2011 Lecture 07: Pass Transistor Logic

ELEC516 Digital VLSI System Design and Design Automation (spring, 2010) Assignment 4 Reference solution

ECE/Comp Sci 352 Digital System Fundamentals Quiz # 1 Solutions

The Test Vector Problem and Limitations to Evolving Digital Circuits

ENGG1015 Homework 1 Question 1. ENGG1015: Homework 1

Chapter 2 Fault Modeling

Lab #10: Design of Finite State Machines

The Test Vector Problem and Limitations to Evolving Digital Circuits

CARNEGIE MELLON UNIVERSITY DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING DIGITAL INTEGRATED CIRCUITS FALL 2002

FAULT MODELING. Chapter Defects, Errors, and Faults

Dr. Nicola Nicolici COE/EE2DI4 Midterm Test #2 Nov 22, 2006

A New Design Method for Unidirectional Circuits

Practice Final Exam Solutions

Chemistry Unit 1 Worksheet 3 Mass, Volume, and Density

ENGG1015: Homework 1

CMSC 313 Lecture 19 Combinational Logic Components Programmable Logic Arrays Karnaugh Maps

Transcription:

inal xam: Graduate ourse { VLSI Testing uburn Univ., L 7250, Spring 2004 May 10, 2004 Instructions (please read before you proceed): 1. Please read all problems before starting your answers. Problems can be answered in any order. 2. ttempt all six problems and attempt all parts within each problem. 3. nswers can be written on question sheets or separate sheets or a combination. ach sheet should have a page number and problem number. On the rst sheet write your name and the total number of sheets you are submitting. 4. efore handing in your answers, please check them thoroughly. If necessary, extra 10 minutes can be allowed for checking. Problem 1: ault Modeling (16 Points) or the circuit of igure 1, determine fault equivalences among the ve faults shown. J sa1 L G sa0 sa0 H sa1 K sa1 M igure 1: ircuit for fault modeling problem. Page1of6

Problem 2: Testability Measures (16 Points) or the circuit of igure 2 compute SOP combinational controllability and observability measures for all lines (8 points). I D J K G H igure 2: ircuit for testability measures problem. L (i) ssuming that the testability of a stuck-at fault can be represented as the sum of appropriate controllability and observability, nd the set of most dicult to test faults (4 points). (ii) Proving a fault to be redundant is a dicult task for an TPG program. This circuit has three redundant faults, I s-a-1, J s-a-1, and s-a-1. re all of these faults in your set of most dicult to test faults? If not, explain why not (4 points). Page2of6

Problem 3: Logic Simulation (17 Points) The following conversation is recorded at a meeting to discuss the verication problems of the circuit shown in igure 3: K igure 3: ircuit for Problem 3. Designer: Why does our logic simulator not initialize my circuit? D ngineer: That is due to a limitation of the three-state logic simulator. Designer: Irrespective of the initial state, the ip-op should initialize to 1 state when 1 is applied at the input and the circuit is clocked. I am not going to change the circuit. You better x your simulator. D Manager (not realizing what is being promised): My engineer will nd a solution before the end of the day. You are the D engineer who must take the challenge: (i) Devise a modication of the three-state logic simulator that will correctly initialize the circuit of igure 3 containing a single ip-op (9 points). (ii) How will you extend the new procedure for circuits with many ip-ops (4 points)? Discuss any limitations (4 points). Page3of6

Problem 4: Podem (17 points) Use the Podem algorithm to derive a test for the fault G stuck-at-0 in the Schneider's example circuit from Roth's 1967 paper, which is shown in igure 4 (8 points). G (2,3)9 J SOP Testability Measures (0, 1) O (2,3)10 K (2,3)10 sa0 (2,3)10 (5,9)0 L H (2,3)9 M igure 4: Schneider's circuits for Podem problem. Neatly write all steps, specifying objectives, operations (backtrace, forward implications, X-path check, etc.) Give the state of the implication stack at each step. (9 points). Page4of6

Problem 5: Delay Test (17 points) (i) Specify a single input change (SI) test for the critical path " a ; z (shown in bold lines) in the circuit of igure 5(i). Is this a robust test? (8 points) (ii) The circuit of igure 5(i) is redesigned in igure 5(ii) to reduce the delay. Will the SI test obtained above still test the longest delay path shown in bold lines? If not, what is the minimum modication required in the test? (9 points) a b c d e f g h i (i) Original circuit. z a b c d e f g h i z (ii) Redesigned circuit. igure 5: ircuits for delay test problem. Page5of6

Problem 6: DT (17 Points) The circuit in igure 6 is a sequence detector. sequence 11111 in the input bitstream at locks the output to 1. The output can be unlocked by applying R =1. K R igure 6: ircuit for DT Problem 6. or scan design, only one pin is available and the only circuit element that can be used is a two-to-one multiplexer. (i) Redesign the circuit using minimum extra hardware to conform to the scan design rule, \clock must not be gated by acombinational signal." Neatly sketch the redesigned circuit (8 points). (ii) Sketch aschematic of the full-scan circuit using minimum extra overhead. Show the complete wiring of the SNIN, SN OU T and test control (T) signals (9 points). Page6of6