Pseudorandom Testability – Study of the Effect of the Generator Type Petr Fišer, Hana Kubátová Czech Technical University in Prague Dept. of Computer Science.

Slides:



Advertisements
Similar presentations
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 261 Lecture 26 Logic BIST Architectures n Motivation n Built-in Logic Block Observer (BILBO) n Test.
Advertisements

1 EE 587 SoC Design & Test Partha Pande School of EECS Washington State University
NATW 2008 Using Implications for Online Error Detection Nuno Alves, Jennifer Dworak, R. Iris Bahar Division of Engineering Brown University Providence,
On the Selection of Efficient Arithmetic Additive Test Pattern Generators S. Manich, L. García, L. Balado, E. Lupon, J. Rius, R. Rodriguez, J. Figueras.
Scalable Test Pattern Generator Design Method for BIST Petr Fišer, Hana Kubátová Czech Technical University in Prague Faculty of Electrical Engineering.
Efficient Compression and Application of Deterministic Patterns in a Logic BIST Architecture Peter Wohl, John A. Waicukauski, Sanjay Patel, Minesh B. Amin.
Copyright 2005, Agrawal & BushnellVLSI Test: Lecture 21alt1 Lecture 21alt BIST -- Built-In Self-Test (Alternative to Lectures 25, 26 and 27) n Definition.
Nitin Yogi and Vishwani D. Agrawal Auburn University Auburn, AL 36849
BEACON CLASS SEP 24TH Replication & misc. Today’s topics Replication and reproducibility How much memory does Avida use? Saving highly evolved critters.
© Manasa Quantifying Metrics for Resilient and Survivable Networks EECS 801 Graduate Reading © 2008–Manasa K 6 June 2008 Manasa K Department of Electrical.
Design for Testability Theory and Practice Lecture 11: BIST
Embedded Hardware and Software Self-Testing Methodologies for Processor Cores Li Chen, Sujit Dey, Pablo Sanchez, Krishna Sekar, and Ying Chen Design Automation.
Comparison of LFSR and CA for BIST
Ugur Kalay, Marek Perkowski, Douglas Hall Universally Testable AND-EXOR Networks Portland State University Speaker: Alan Mishchenko.
ELEN 468 Lecture 251 ELEN 468 Advanced Logic Design Lecture 25 Built-in Self Test.
TOPIC - BIST architectures I
3. Built-In Self Test (BIST): Periodical Off-Line Test on the Field 3.1 General Structure Unit Under Test Data Compressor Data Generator Comparator Display.
BIST vs. ATPG.
BIST AND DATA COMPRESSION 1 JTAG COURSE spring 2006 Andrei Otcheretianski.
Generating Random Numbers in Hardware. Two types of random numbers used in computing: --”true” random numbers: ++generated from a physical source (e.g.,
ETM 607 – Random Number and Random Variates
How Significant Is the Effect of Faults Interaction on Coverage Based Fault Localizations? Xiaozhen Xue Advanced Empirical Software Testing Group Department.
Unit II Test Generation
Testimise projekteerimine: Labor 2 BIST Optimization
1 A Flexible Minimization and Partitioning Method Petr Fišer, Jan Hlavička Czech Technical University in Prague
Mugil Vannan H ST Microelectronics India Pvt. Ltd, Noida
Flexible Two-Level Boolean Minimizer BOOM ‑ II and Its Applications Petr Fišer, Hana Kubátová Department of Computer Science and Engineering Czech Technical.
A Test-Per-Clock LFSR Reseeding Algorithm for Concurrent Reduction on Test Sequence Length and Test Data Volume Adviser :蔡亮宙 Student ;蔡政宏.
1/ , Graz, Austria Power Spectral Density of Convolutional Coded Pulse Interval Modulation Z. Ghassemlooy, S. K. Hashemi and M. Amiri Optical Communications.
Unit IV Self-Test and Test Algorithms
Pseudo-Random Pattern Generator Design for Column ‑ Matching BIST Petr Fišer Czech Technical University Dept. of Computer Science and Engineering.
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTEMS Built-In Self-Test (BIST) - 1.
THE TESTING APPROACH FOR FPGA LOGIC CELLS E. Bareiša, V. Jusas, K. Motiejūnas, R. Šeinauskas Kaunas University of Technology LITHUANIA EWDTW'04.
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTEMS
Test pattern generator is BIST scan chains TESTGENERATOR COMPACOMPACCTTOORRCOMPACOMPACCTTOORRCTOR Control.
December, 2004 Ecole Polytechnique 1 Deterministic BIST By Amiri Amir Mohammad Professor Dr. Abdelhakim Khouas Project Presentation for ELE6306 (Test des.
BoolTool: A Tool for Manipulation of Boolean Functions Petr Fišer, David Toman Czech Technical University in Prague Dept. of Computer Science and Engineering.
Linear Feedback Shift Register. 2 Linear Feedback Shift Registers (LFSRs) These are n-bit counters exhibiting pseudo-random behavior. Built from simple.
How Much Randomness Makes a Tool Randomized? Petr Fišer, Jan Schmidt Faculty of Information Technology Czech Technical University in Prague
Boolean Minimizer FC-Min: Coverage Finding Process Petr Fišer, Hana Kubátová Czech Technical University Department of Computer Science and Engineering.
Page 1EL/CCUT T.-C. Huang May 2004 TCH CCUT Introduction to IC Test Tsung-Chu Huang ( 黃宗柱 ) Department of Electronic Eng. Chong Chou Institute of Tech.
Frankfurt (Germany), 6-9 June 2011 M. Khederzadeh Power & Water University of Technology (PWUT) Tehran, IRAN. M.Khederzadeh – IRAN – RIF S3 – Paper 0066.
Two-Level Boolean Minimizer BOOM-II Petr Fišer, Hana Kubátová Department of Computer Science and Engineering Czech Technical University Karlovo nam. 13,
A High-Speed Hardware Implementation of the LILI-II Keystream Generator Paris Kitsos...in cooperation with Nicolas Sklavos and Odysseas Koufopavlou Digital.
Survey of the Algorithms in the Column-Matching BIST Method Survey of the Algorithms in the Column-Matching BIST Method Petr Fišer, Hana Kubátová Department.
Output Grouping Method Based on a Similarity of Boolean Functions Petr Fišer, Pavel Kubalík, Hana Kubátová Czech Technical University in Prague Department.
1 Watermarking Scheme Capable of Resisting Sensitivity Attack IEEE signal processing letters, vol. 14, no. 2, February. 2007, pp Xinpeng Zhang.
Mixed-Mode BIST Based on Column Matching Petr Fišer.
1 1 Slide Simulation Professor Ahmadi. 2 2 Slide Simulation Chapter Outline n Computer Simulation n Simulation Modeling n Random Variables and Pseudo-Random.
Pseudo Randomness (in digital system) PRESENTED BY GROUP 8 SHU-YU HUANG, FONG-JHENG LIN
Built-In Self Test (BIST).  1. Introduction  2. Pattern Generation  3. Signature Analysis  4. BIST Architectures  5. Summary Outline.
Technical University Tallinn, ESTONIA Copyright by Raimund Ubar 1 Raimund Ubar N.Mazurova, J.Smahtina, E.Orasson, J.Raik Tallinn Technical University.
1 Implicant Expansion Methods Used in The BOOM Minimizer Petr Fišer, Jan Hlavička Czech Technical University, Karlovo nám. 13, Prague 2
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.
Multiple-Vector Column-Matching BIST Design Method Petr Fišer, Hana Kubátová Department of Computer Science and Engineering Czech Technical University.
November 25Asian Test Symposium 2008, Nov 24-27, Sapporo, Japan1 Sequential Circuit BIST Synthesis using Spectrum and Noise from ATPG Patterns Nitin Yogi.
البحث السابع بحث منفرد منشور فى مؤتمر دولى متخصص (منشورة التحكيم علي البحث الكامل) Adel A. Elbaset 13th International Middle East Power System Conference,
ECE 442 COMMUNICATION SYSTEM DESIGN LECTURE 10. LINEAR BLOCK CODES Husheng Li Dept. of EECS The University of Tennessee.
1 Decentralized Adaptive Voltage Control with Distributed Energy Resources Presenter: Huijuan Li.
POWER OPTIMIZATION IN RANDOM PATTERN GENERATOR By D.Girish Kumar 108W1D8007.
TITLE : types of BIST MODULE 5.1 BIST basics
1 Modeling Synchronous Logic Circuits Debdeep Mukhopadhyay Associate Professor Dept of Computer Science and Engineering NYU Shanghai and IIT Kharagpur.
SINGLE-LEVEL PARTITIONING SUPPORT IN BOOM-II
VLSI Testing Lecture 14: Built-In Self-Test
Samuel Luckenbill1, Ju-Yueh Lee2, Yu Hu3, Rupak Majumdar1, and Lei He2
Lecture 26 Logic BIST Architectures
Mixed-Mode BIST Based on Column Matching
Test Data Compression for Scan-Based Testing
Fast Boolean Minimizer for Completely Specified Functions
Presentation transcript:

Pseudorandom Testability – Study of the Effect of the Generator Type Petr Fišer, Hana Kubátová Czech Technical University in Prague Dept. of Computer Science & Engineering Karlovo nám. 13, CZ , Prague 2, Czech Rep.

Outline Introduction Introduction LFSR Structure LFSR Structure Fault Coverage Statistics Fault Coverage Statistics Influence of LFSR Influence of LFSR Mixed-Mode BIST Mixed-Mode BIST Column-Matching Column-Matching BIST Design Results BIST Design Results Conclusions Conclusions

Introduction Most of BIST methods are based on LFSR Most of BIST methods are based on LFSR Fault coverage strictly depends on the LFSR type Fault coverage strictly depends on the LFSR type

LFSR Parameters: Generating polynomial Seed

Fault Coverage Statistics  Pseudo-Random Testability Depends on the number of hard-to-detect faults Depends on the number of hard-to-detect faults The number of pseudo-random test patterns strictly depends on the LFSR polynomial & seed The number of pseudo-random test patterns strictly depends on the LFSR polynomial & seed This number notably varies This number notably varies

Fault Coverage Statistics – complete fault coverage

Fault Coverage Statistics – non-complete fault coverage

Influence of the LFSR type

Important observation – the fault coverage capabilities are steadily distributed Important observation – the fault coverage capabilities are steadily distributed Primitive polynomials are not needed (if the period is satisfied) Primitive polynomials are not needed (if the period is satisfied) Best poly: one-tap Best poly: one-tap

Mixed-Mode BIST The test is divided into two phases Pseudo-Random – try to detect easy-to-detect faults Pseudo-Random – try to detect easy-to-detect faults Deterministic – generate deteterministic patterms Deterministic – generate deteterministic patterms

Column-Matching LFSR produces code words LFSR produces code words These have to be transformed into deterministic patterns (APTG) These have to be transformed into deterministic patterns (APTG) => Output Decoder

Column-Matching Mixed-Mode BIST Simulate first n LFSR patterns Determine undetected faults Compute a test for them (APTG) Make a decoder producing test from LFSR patterns > n

Influence of the test length benchrand / det.ud.vct.GEs c / / c / / / s / / / s / /

Influence of LFSR ud.vct.GEsud.vct.GEs

Conclusions The effect of the LFSR type on the fault coverage was studied The effect of the LFSR type on the fault coverage was studied FC strictly depends on LFSR poly & seed FC strictly depends on LFSR poly & seed But cannot be computed But cannot be computed Primitive polynomial is not necessary Primitive polynomial is not necessary The best poly is one-tap The best poly is one-tap Shown in praxis – Column-Matching BIST Shown in praxis – Column-Matching BIST