Final Exam CPSC/ECEN 680 May 2, Name: UIN:

Similar documents
Instructions. Final Exam CPSC/ELEN 680 December 12, Name: UIN:

Overview: Logic BIST

VLSI System Testing. BIST Motivation

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

Design for Test. Design for test (DFT) refers to those design techniques that make test generation and test application cost-effective.

VLSI Test Technology and Reliability (ET4076)

Design of Fault Coverage Test Pattern Generator Using LFSR

for Digital IC's Design-for-Test and Embedded Core Systems Alfred L. Crouch Prentice Hall PTR Upper Saddle River, NJ

Jin-Fu Li Advanced Reliable Systems (ARES) Laboratory. National Central University

ECE 715 System on Chip Design and Test. Lecture 22

Y. Tsiatouhas. VLSI Systems and Computer Architecture Lab. Built-In Self Test 2

A clock is a free-running signal with a cycle time. A clock may be either high or low, and alternates between the two states.

CMOS Testing-2. Design for testability (DFT) Design and Test Flow: Old View Test was merely an afterthought. Specification. Design errors.

CSE 352 Laboratory Assignment 3

Using on-chip Test Pattern Compression for Full Scan SoC Designs

Design for Testability

UNIT IV CMOS TESTING. EC2354_Unit IV 1

Chapter 8 Design for Testability

Testing Digital Systems II

SIC Vector Generation Using Test per Clock and Test per Scan

Testability: Lecture 23 Design for Testability (DFT) Slide 1 of 43

Testing Digital Systems II

Based on slides/material by. Topic 14. Testing. Testing. Logic Verification. Recommended Reading:

Design of Test Circuits for Maximum Fault Coverage by Using Different Techniques

First Name Last Name November 10, 2009 CS-343 Exam 2

Implementation of BIST Test Generation Scheme based on Single and Programmable Twisted Ring Counters

Bit Swapping LFSR and its Application to Fault Detection and Diagnosis Using FPGA

Figure 1 shows a simple implementation of a clock switch, using an AND-OR type multiplexer logic.

Clocks. Sequential Logic. A clock is a free-running signal with a cycle time.

I. INTRODUCTION. S Ramkumar. D Punitha

K.T. Tim Cheng 07_dft, v Testability

International Journal of Scientific & Engineering Research, Volume 5, Issue 9, September ISSN

MULTI-CYCLE AT SPEED TEST. A Thesis MALLIKA SHREE POKHAREL

Design for Testability Part II

Department of Electrical and Computer Engineering Mid-Term Examination Winter 2012

Testing Sequential Circuits

VLSI Technology used in Auto-Scan Delay Testing Design For Bench Mark Circuits

A Novel Low Power pattern Generation Technique for Concurrent Bist Architecture

Scan. This is a sample of the first 15 pages of the Scan chapter.

Lecture 18 Design For Test (DFT)

CPE 628 Chapter 5 Logic Built-In Self-Test. Dr. Rhonda Kay Gaede UAH. UAH Chapter Introduction

Design and Implementation OF Logic-BIST Architecture for I2C Slave VLSI ASIC Design Using Verilog

VLSI Design Verification and Test BIST II CMPE 646 Space Compaction Multiple Outputs We need to treat the general case of a k-output circuit.

Diagnosis of Resistive open Fault using Scan Based Techniques

Diagnostic Test Generation for Path Delay Faults in a Scan Circuit. Zeshi Luo

DIGITAL SYSTEM FUNDAMENTALS (ECE421) DIGITAL ELECTRONICS FUNDAMENTAL (ECE422) LATCHES and FLIP-FLOPS

DESIGN FOR TESTABILITY

Design and Implementation of Uart with Bist for Low Power Dissipation Using Lp-Tpg

Lecture 17: Introduction to Design For Testability (DFT) & Manufacturing Test

Cell-Aware Fault Analysis and Test Set Optimization in Digital Integrated Circuits

Strategies for Efficient and Effective Scan Delay Testing. Chao Han

1. Convert the decimal number to binary, octal, and hexadecimal.

DETERMINISTIC SEED RANGE AND TEST PATTERN DECREASE IN LOGIC BIST

6.S084 Tutorial Problems L05 Sequential Circuits

Simulation Mismatches Can Foul Up Test-Pattern Verification

Doctor of Philosophy

Experiment 8 Introduction to Latches and Flip-Flops and registers

超大型積體電路測試 國立清華大學電機系 EE VLSI Testing. Chapter 5 Design For Testability & Scan Test. Outline. Introduction

Unit V Design for Testability

Czech Technical University in Prague Faculty of Information Technology Department of Digital Design

Test Compression for Circuits with Multiple Scan Chains

Design for test methods to reduce test set size

VHDL Implementation of Logic BIST (Built In Self Test) Architecture for Multiplier Circuit for High Test Coverage in VLSI Chips

Unit 8: Testability. Prof. Roopa Kulkarni, GIT, Belgaum. 29

problem maximum score 1 28pts 2 10pts 3 10pts 4 15pts 5 14pts 6 12pts 7 11pts total 100pts

Lecture 23 Design for Testability (DFT): Full-Scan (chapter14)

Lecture 23 Design for Testability (DFT): Full-Scan

This Chapter describes the concepts of scan based testing, issues in testing, need

CS 110 Computer Architecture. Finite State Machines, Functional Units. Instructor: Sören Schwertfeger.

A Novel Method for UVM & BIST Using Low Power Test Pattern Generator

LFSR TEST PATTERN FOR FAULT DETECTION AND DIAGNOSIS FOR FPGA CLB CELLS

Sequential Logic. E&CE 223 Digital Circuits and Systems (A. Kennings) Page 1

A New Approach to Design Fault Coverage Circuit with Efficient Hardware Utilization for Testing Applications

LFSRs as Functional Blocks in Wireless Applications Author: Stephen Lim and Andy Miller

Design of BIST with Low Power Test Pattern Generator

Logic and Computer Design Fundamentals. Chapter 7. Registers and Counters

YEDITEPE UNIVERSITY DEPARTMENT OF COMPUTER ENGINEERING. EXPERIMENT VIII: FLIP-FLOPS, COUNTERS 2014 Fall

Transactions Brief. Circular BIST With State Skipping

Power Optimization of Linear Feedback Shift Register (LFSR) using Power Gating

Based on slides/material by. Topic Testing. Logic Verification. Testing

Computer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: Sequential Circuits

Weighted Random and Transition Density Patterns For Scan-BIST

CHAPTER 4: Logic Circuits

More Digital Circuits

EE 109 Homework 6 State Machine Design Name: Score:

2.6 Reset Design Strategy

CHAPTER 4 RESULTS & DISCUSSION

Testing of Cryptographic Hardware

Built-In Self-Testing of Micropipelines

Synthesis Techniques for Pseudo-Random Built-In Self-Test Based on the LFSR

At-speed testing made easy

[Krishna*, 4.(12): December, 2015] ISSN: (I2OR), Publication Impact Factor: 3.785

Power Problems in VLSI Circuit Testing

Digital Integrated Circuits Lecture 19: Design for Testability

FOR A DISSERTATION SUBMITTED TO THE DEPARTMENT OF ELECTRICAL ENGINEERING AND THE COMMITTEE ON GRADUATE STUDIES OF STANFORD UNIVERSITY

Built-In Self-Test (BIST) Abdil Rashid Mohamed, Embedded Systems Laboratory (ESLAB) Linköping University, Sweden

Random Access Scan. Veeraraghavan Ramamurthy Dept. of Electrical and Computer Engineering Auburn University, Auburn, AL

Module 8. Testing of Embedded System. Version 2 EE IIT, Kharagpur 1

Chip-Level DFT: Some New, And Not So New, Challenges

data and is used in digital networks and storage devices. CRC s are easy to implement in binary

Transcription:

Final Exam CPSC/ECEN 680 May 2, 2008 Name: UIN: Instructions This exam is closed book. Provide brief but complete answers to the following questions in the space provided, using figures as necessary. Show your work for partial credit. 1. (10 pts) In a regular SOC, a TAM is used to deliver test patterns and collect test results from the cores. Suppose you have a TAM that has 10 data lines, and all cores have MISRs so that test results do not have to be read while the test patterns are delivered. We will ignore the time to read back the MISRs. Consider an SOC with 4 cores. Core 1 has test patterns that can be delivered on 3 lines in 10000 cycles, 6 lines in 5000 cycles or 10 lines in 3000 cycles. Core 2 has test patterns that can be delivered on 3 lines in 20000 cycles, 4 lines in 15000 cycles or 5 lines in 12000 cycles. Cores 3 and 4 have test patterns that can be delivered on 2 lines in 20000 cycles or 4 lines in 10000 cycles. Draw the shortest test schedule.

2. PODEM Algorithm i. (12 pts) In the figure below, use the PODEM algorithm to test for a SA1 on the output of gate 6. Write on the figure and explain the sequence of decisions. ii. (3 pts) The algorithm will not select A=0 and B=0. Why not? SA1

3. (15 pts) For the circuit below, the flip-flops numbered 7 and 8 are connected together in a scan chain (assume the scan chain is from 7 to 8). Their D inputs can be directly observed as pseudoprimary outputs (PPOs). The flip-flop outputs Q1 and Q2 can be directly controlled as pseudoprimary inputs (PPIs). Compute the combinational SCOAP testability measures on all lines - both controllability and observability, including the clock CL. The flip-flops do not have a set/reset line. Write your SCOAP measures on the figure using standard notation. Extra copies of the circuit are attached to the exam to aid you in working out your solution. Do you need to compute the sequential SCOAP measures? Why or why not?

4. You have a chip with yield Y and a test set with fault coverage T. i. (3 pts) For Y=90% and T=99%, what is the defect level in DPM? ii. (4 pts) Your customer complains that the defect level is too high. They want you to reduce it to 100 DPM. What yield Y would be necessary to achieve this, given T=99%? iii. (3 pts) What fault coverage T would be necessary to achieve this 100 DPM, given Y=90%?

5. You wish to implement an LFSR using the characteristic polynomial x 6 + x 5 + x 3 + x 2 + 1. i. (5 pts) Draw the schematic for a modular LFSR (XOR gates between the flip-flops). Show a signal to initialize the LFSR via the flip-flop set/reset pins. The pins are active low. ii. (5 pts) Draw the schematic for an external LFSR (XOR gates on the feedback path). Show a signal to initialize the LFSR via the flip-flop set/reset pins. The pins are active low. The starting state does not have to be the same as the internal LFSR above.

6. (10 pts) For a modular LFSR implementing the primitive polynomial x 6 + x 5 + x 3 + x 2 + 1, add minimal hardware to the LFSR so that it will also generate the all-zero state, while also generating all of its previous states. Between which two states will the all-zero state be inserted? Remember that the flip-flop outputs have true and complement values available. Draw the schematic of the LFSR with all-zero logic. Do not show the set/reset logic.

7. A test set achieves 100% toggle coverage. That is, it sets every line in the circuit to both a 0 and a 1 at least once in the test set. i. (5 pts) Does such a test set achieve 100% stuck-at fault coverage? Explain your answer. Use examples as needed. ii. (5 pts) Why will a toggle test have relatively high bridge fault coverage in an I DDQ test? Explain your answer. Use examples as needed.

8. (5 pts) Give an example of how scan test can have higher power dissipation than functional operation. 9. (5 pts) Suppose that the maximum data rate of a link using embedded clock to connect CPU to memory is 10 Gbps, but you need a bandwidth of 40 Gbps. How would you solve this problem?

10. (10 pts) Show input and line values for a delay test along one of the longest robustly-testable paths in the circuit below. Assume each gate has unit delay. Remember that a robust test is one that will detect a delay fault independent of other delays in the circuit, so it should still work correctly even if the gates have arbitrary delays.

Extra sheets for Problem 3.

Extra sheets for Problem 3.