X-Alignment Techniques for Improving the Observability of Response Compactors Ozgur Sinanoglu Sobeeh Almukhaizim† Math & Computer Science Department Computer.

Slides:



Advertisements
Similar presentations
Retiming Scan Circuit To Eliminate Timing Penalty
Advertisements

Advanced ITC Presentation A. Pogiel J. Rajski J. Tyszer.
CSCE430/830 Computer Architecture
1 Pattern-Directed Circuit Virtual Partitioning for Test Power Reduction Qiang Xu The Chinese University of Hong Kong Dianwei Hu and Dong Xiang Tsinghua.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 261 Lecture 26 Logic BIST Architectures n Motivation n Built-in Logic Block Observer (BILBO) n Test.
Introduction to VHDL CLASS MATERIALS EECE 255. Very High Speed Integrated Circuit Hardware Description Language Industry standard language to describe.
ELEC Digital Logic Circuits Fall 2014 Logic Synthesis (Chapters 2-5) Vishwani D. Agrawal James J. Danaher Professor Department of Electrical and.
1 A Random Access Scan Architecture to Reduce Hardware Overhead Anand S. Mudlapur Vishwani D. Agrawal Adit D. Singh Department of Electrical and Computer.
An Overview of RAID Chris Erickson Graduate Student Department of Electrical and Computer Engineering Auburn University, Auburn, AL 36849
Aiman El-Maleh, Ali Alsuwaiyan King Fahd University of Petroleum & Minerals, Dept. of Computer Eng., Saudi Arabia Aiman El-Maleh, Ali Alsuwaiyan King Fahd.
Nitin Yogi and Vishwani D. Agrawal Auburn University Auburn, AL 36849
X-Compaction Itamar Feldman. Before we begin… Let’s talk about some DFT history: Design For Testability (DFT) has been around since the 1960s. The technology.
Computational statistics 2009 Random walk. Computational statistics 2009 Random walk with absorbing barrier.
4/28/05Vemula: ELEC72501 Enhanced Scan Based Flip-Flop for Delay Testing By Sudheer Vemula.
An Arithmetic Structure for Test Data Horizontal Compression Marie-Lise FLOTTES, Regis POIRIER, Bruno ROUZEYRE Laboratoire d’Informatique, de Robotique.
October 8, th Asian Test Symposium 2007, Biejing, China XXXXX00XXX XX000101XXXXXXXXXXXXX0XXX1X0 101XXX1011XXXXXX0XXX XX000101XXXXXXXXXXXXX0XXX1XX.
Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Topics n Shifters. n Adders and ALUs.
Triple Patterning Aware Detailed Placement With Constrained Pattern Assignment Haitong Tian, Yuelin Du, Hongbo Zhang, Zigang Xiao, Martin D.F. Wong.
BIST vs. ATPG.
DFT Technologies for High- Quality Low-Cost Manufacturing Tests Yuval Snir JTAG 2006 Yuval Snir JTAG 2006.
1 Enhancing Random Access Scan for Soft Error Tolerance Fan Wang* Vishwani D. Agrawal Department of Electrical and Computer Engineering, Auburn University,
EE141 VLSI Test Principles and Architectures Ch. 6 - Test Compression – P. 1 1 Chapter 6 Test Compression.
Testimise projekteerimine: Labor 2 BIST Optimization
Context Tailoring the DBMS –To support particular applications Beyond alphanumerical data Beyond retrieve + process –To support particular hardware New.
1 Fitting ATE Channels with Scan Chains: a Comparison between a Test Data Compression Technique and Serial Loading of Scan Chains LIRMM CNRS / University.
New Modeling Techniques for the Global Routing Problem Anthony Vannelli Department of Electrical and Computer Engineering University of Waterloo Waterloo,
2013/10/21 Yun-Chung Yang An Energy-Efficient Adaptive Hybrid Cache Jason Cong, Karthik Gururaj, Hui Huang, Chunyue Liu, Glenn Reinman, Yi Zou Computer.
Logic BIST Logic BIST.
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTEMS
Test pattern generator is BIST scan chains TESTGENERATOR COMPACOMPACCTTOORRCOMPACOMPACCTTOORRCTOR Control.
Modern VLSI Design 4e: Chapter 6 Copyright  2008 Wayne Wolf Topics n Shifters. n Adders and ALUs.
1/14 Synthesis and Design of Parameter Extractors for Low-Power Pre-computation-Based Content-addressable Memory Using Gate- Block Selection Algorithm.
TOPIC : Introduction to Compression Techniques UNIT 5 : BIST and BIST Architectures Module 5.4 Compression Techniques.
1 Special Continuous Probability Distributions -Exponential Distribution -Weibull Distribution Dr. Jerrell T. Stracener, SAE Fellow Leadership in Engineering.
Efficient Downloading and Updating Application on Smart Cards Yongsu Park, Junyoung Heo, Yookun Cho School of Computer Science and Engineering Seoul National.
Niloy Ganguly Biplab K Sikdar P Pal Chaudhuri Presented by Niloy Ganguly Indian Institute of Social Welfare and Business Management. Calcutta
CS3505: DATA LINK LAYER. data link layer  phys. layer subject to errors; not reliable; and only moves information as bits, which alone are not meaningful.
Feng-Xiang Huang Test Symposium(ETS), th IEEE European Ko, Ho Fai; Nicolici, Nicola; Department of Electrical and Computer Engineering,
By Praveen Venkataramani
Weikang Qian. Outline Intersection Pattern and the Problem Motivation Solution 2.
Lopamudra Kundu Reg. No. : of Roll No.:- 91/RPE/ Koushik Basak
Information Integrity and Message Digests CSCI 5857: Encoding and Encryption.
Timo O. Korhonen, HUT Communication Laboratory 1 Convolutional encoding u Convolutional codes are applied in applications that require good performance.
Useless Memory Allocation in System on a Chip Test: Problems and Solutions Paul Theo Gonciari Bashir Al-Hashimi Electronic Systems Design Group University.
1 1 Slide © 2004 Thomson/South-Western Simulation n Simulation is one of the most frequently employed management science techniques. n It is typically.
TELECOMMUNICATIONS Dr. Hugh Blanton ENTC 4307/ENTC 5307.
A Test-Per-Clock LFSR Reseeding Algorithm for Concurrent Reduction on Test Sequence Length and Test Data Volume Wei-Cheng Lien 1, Kuen-Jong Lee 1 and Tong-Yu.
Output Grouping-Based Decomposition of Logic Functions Petr Fišer, Hana Kubátová Department of Computer Science and Engineering Czech Technical University.
Deterministic Diagnostic Pattern Generation (DDPG) for Compound Defects Fei Wang 1,2, Yu Hu 1, Huawei Li 1, Xiaowei Li 1, Jing Ye 1,2 1 Key Laboratory.
November 25Asian Test Symposium 2008, Nov 24-27, Sapporo, Japan1 Sequential Circuit BIST Synthesis using Spectrum and Noise from ATPG Patterns Nitin Yogi.
A Survey of Fault Tolerant Methodologies for FPGA’s Gökhan Kabukcu
July 10, th VLSI Design and Test Symposium1 BIST / Test-Decompressor Design using Combinational Test Spectrum Nitin Yogi Vishwani D. Agrawal Auburn.
MAPLD 2005/213Kakarla & Katkoori Partial Evaluation Based Redundancy for SEU Mitigation in Combinational Circuits MAPLD 2005 Sujana Kakarla Srinivas Katkoori.
Fang Fang James C. Hoe Markus Püschel Smarahara Misra
Presenter: Darshika G. Perera Assistant Professor
-Exponential Distribution -Weibull Distribution
Test Sequence Length Requirements for Scan-based Testing
MAPLD 2005 BOF-L Mitigation Methods for
King Fahd University of Petroleum and Minerals
DATA.
Sungho Kang Yonsei University
Use ECP, not ECC, for hard failures in resistive memories
Aiman H. El-Maleh Sadiq M. Sait Syed Z. Shazli
RECONFIGURABLE NETWORK ON CHIP ARCHITECTURE FOR AEROSPACE APPLICATIONS
MS Thesis Defense Presentation by Mustafa Imran Ali COE Department
Improved Random Pattern Delay Fault Coverage Using Inversion Test Points Soham Roy, Brandon Steine, Spencer Millican, Vishwani Agrawal Dept. of Electrical.
Lecture 26 Logic BIST Architectures
Test Data Compression for Scan-Based Testing
A Random Access Scan Architecture to Reduce Hardware Overhead
Simple Hash Functions Network Security.
Presentation transcript:

X-Alignment Techniques for Improving the Observability of Response Compactors Ozgur Sinanoglu Sobeeh Almukhaizim† Math & Computer Science Department Computer Engineering Department Kuwait University 년 10 월 16 일 김인수 1

Purposes of this paper Improving the observability of response compactors. Enhancing fault detection per test pattern. Making room for more test patterns in the tester memory. –Propose X-Align technique. 2

Properties of X-alignment techniques X-alignment hardware is fixed for a given design and is independent of any test set and any fault model. X-alignment hardware can be reconfigured based on any given set of test responses. X-alignment techniques can be utilized in conjunction with any response compactor to manipulate x-distribution in favor of the compactor X-alignment hardware has a small area overhead and its insertion can be seamlessly integrated into the conventional design flow. 3

Response compaction techniques 4 Vertical Compaction Methods Horizontal Compaction Methods

XOR-based V-compaction XOR-based compaction with two parity trees 5

XOR-based V-compaction with V-align Delaying shift-out operations in two scan chains for aligning x’s 6

Vertical Align block 7 Δ MAX (maximum allowable delay) = 3 XOR-based V-compaction with V-align

Vertical Alignment of X’s 8 the transformation of the scan response into a map of known and unknown bits. T(c, δ) := 1 if(δ − 1) th cell of c th chain = x, 0 otherwise 0 ≤ c < num_chains, 1 ≤ δ ≤ depth the definition of the solution variables. dc := 1 if c th chain is delayed, 0 otherwise 0 ≤ c < num_chains

9 if the scan slice i is observable: s0 = (d0 + d0) ∧ (d1 + d1) ∧ (0 + d2) ∧ (d3 + d3) = d2 : AND clause s1 = d1 ∧ d2 ∧ d3 s2 = d0 ∧ d1 ∧ d2 ∧ d3 s3 = 0 s4 = d0 Slices : d0 = d2 = 1, d1 = d3 = 0 s1 = s4 = 1, s0 = s2 = s3 = 0 Vertical Alignment of X’s

XOR-based H-compaction with H-align Horizontal Align block 10

Horizontal Alignment of X’s 11 the rotation of scan slices into a map of known and unknown bits. T(c, δ) := 1 if δ th cell of c th chain = x, 0 otherwise 0 ≤ c < num_chains, 0 ≤ δ ≤ depth the definition of the rotation variables. rδ := 1 if δ th chain is rotated, 0 otherwise 0 ≤ δ ≤ depth does not increase the scan depth rotate direction : upward

12 if the scan chain i is observable: c0 = (r0 + r0) ∧ (r1) ∧ (r2) ∧ (r3) = r1 ∧ r2 ∧ r3 : AND clause c1 = r0 ∧ r1 ∧ r2 c2 = r0 ∧ r1 ∧ r2 c3 = r1 ∧ r2 ∧ r3 r1 = 1, r0 = r2 = r3 = 0 c1 = c3 = 1, c0 = c2 = 0 Chains: Horizontal Alignment of X’s

2D-alignment Vertical Alignment Horizontal Alignment 13

14 Without Alignment (Obs = 0) With h-align Only (Obs = 8) With v-align Only (Obs = 6) With v-align After h-Align (Obs = 10) 2D-alignment

A clear advantage of aligning x’s in both directions (regardless of the order) is that the observability level of the 2D-alignment is guaranteed to surpass, or be equal to, that when x’s are aligned in one direction only. 15 2D-alignment

Response Shaper 16

X-Alignment: Random Responses 17 Px : unknown probability # of observable scan cells Δ MAX = 1

18 A, B : two industrial circuits(provided by Cadence) 80X196 : 80 scan chains with a scan depth of 196 # of observable scan cells Δ MAX = 1 X-Alignment: Industrial Responses

COST COMPARISONS ON ISCAS89 CIRCUITS 19 TDV : Test data volume of the base case includes those of uncompressed stimuli and uncompacted responses. The reported area costs for x-align and response shaper do not include the cost of the XOR tree. 20 CHAINS, SINGLE XOR TREE