TOPIC : Introduction to Compression Techniques UNIT 5 : BIST and BIST Architectures Module 5.4 Compression Techniques.

Slides:

Advertisements

Similar presentations

Digital Integrated Circuits© Prentice Hall 1995 Design Methodologies Design for Test.

Advertisements

MEMORY BIST by: Saeid Hashemi Mehrdad Falakparvaz

Combinational Circuits

Control path Recall that the control path is the physical entity in a processor which: fetches instructions, fetches operands, decodes instructions, schedules.

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

TOPIC : Finite State Machine(FSM) and Flow Tables UNIT 1 : Modeling Module 1.4 : Modeling Sequential circuits.

1 EE24C Digital Electronics Project Theory: Sequential Logic (part 2)

Integers. Integer Storage Since Binary consists only of 0s and 1s, we can’t use a negative sign ( - ) for integers. Instead, the Most Significant Bit.

1 EE 587 SoC Design & Test Partha Pande School of EECS Washington State University

TOPIC : Backtracking Methodology UNIT 3 : VLSI Testing Module 3.2: Arriving at Input Test Vector.

Aug 23, ‘021Low-Power Design Minimum Dynamic Power Design of CMOS Circuits by Linear Program Using Reduced Constraint Set Vishwani D. Agrawal Agere Systems,

Interrupts (contd..) Multiple I/O devices may be connected to the processor and the memory via a bus. Some or all of these devices may be capable of generating.

Basic Input/Output Operations

Dominance Fault Collapsing of Combinational Circuits By Kalpesh Shetye & Kapil Gore ELEC 7250, Spring 2004.

ELEN 468 Lecture 251 ELEN 468 Advanced Logic Design Lecture 25 Built-in Self Test.

TOPIC - BIST architectures I

TOPIC : BILBO BIST Architectures UNIT 5 : BIST and BIST Architectures Module 5.2 BIST.

TOPIC : Introduction to BIST and types of BIST

BIST AND DATA COMPRESSION 1 JTAG COURSE spring 2006 Andrei Otcheretianski.

Sequential Circuit  It is a type of logic circuit whose output depends not only on the present value of its input signals but on the past history of its.

TOPIC : Design of Scan Storage Cells UNIT 4 : Design for testability Module 4.3 Scan Architectures and Testing.

Combinational Logic Design CS341 Digital Logic and Computer Organization F2003.

The CPU The Central Presentation Unit Main Memory and Addresses Address bus and Address Space Data Bus Control Bus The Instructions set Mnemonics Opcodes.

TOPIC : Types of fault simulation

: Chapter 12: Image Compression 1 Montri Karnjanadecha ac.th/~montri Image Processing.

Computer Architecture and Organization Introduction.

Chapter 1 Introduction. Architecture & Organization 1 Architecture is those attributes visible to the programmer —Instruction set, number of bits used.

Introduction to State Machine

TOPIC : Signature Analysis. Introduction Signature analysis is a compression technique based on the concept of (CRC) Cyclic Redundancy Checking It realized.

TOPIC : Test Points UNIT 4 : Design For Testability Module 4.1: Basics of DFT.

TOPIC : Introduction to Fault Simulation

An introduction to Fault Detection in Logic Circuits By Dr. Amin Danial Asham.

TOPIC : Controllability and Observability

Built-In Self Test (BIST).  1. Introduction  2. Pattern Generation  3. Signature Analysis  4. BIST Architectures  5. Summary Outline.

TOPIC : Transition Count Compression UNIT 5 : BIST and BIST Architectures Module 5.4 Compression Techniques.

Functional Modeling.

Combinational Circuits

TOPIC : CBIST, CEBS UNIT 5 : BIST and BIST Architectures Module 5.2 Specific BIST Architectures.

Dynamic Logic Circuits Static logic circuits allow implementation of logic functions based on steady state behavior of simple nMOS or CMOS structures.

Unit1: Modeling & Simulation Module5: Logic Simulation Topic: Unknown Logic Value.

“Towards Self Stabilizing Wait Free Shared Memory Objects” By:  Hopeman  Tsigas  Paptriantafilou Presented By: Sumit Sukhramani Kent State University.

TOPIC : Introduction to Faults UNIT 2: Modeling and Simulation Module 1 : Logical faults due to physical faults.

TOPIC : Test Techniques for some complex circuits UNIT 4 : Design For Testability Module 4.2: DFT Techniques.

TOPIC : Fault detection and fault redundancy UNIT 2 : Fault modeling Module 2.3 Fault redundancy and Fault collapsing.

TOPIC : RTD, SST UNIT 5 : BIST and BIST Architectures Module 5.2 Specific BIST Architectures.

REGISTER TRANSFER LANGUAGE (RTL) INTRODUCTION TO REGISTER Registers1.

TOPIC : Introduction to Faults UNIT 2: Modeling and Simulation Module 1 : Logical faults due to physical faults.

TOPIC : Scan based Design Module 4.3 : Scan architectures and testing UNIT 4 : Design for Testability.

TOPIC : Introduction to Sequential Circuits UNIT 1: Modeling and Simulation Module 4 : Modeling Sequential Circuits.

Working Efficiently with Large SAS® Datasets Vishal Jain Senior Programmer.

Unit 1 Introduction Number Systems and Conversion.

Dr.Faisal Alzyoud 2/20/2018 Binary Arithmetic.

REGISTER TRANSFER LANGUAGE (RTL)

2's Complement Arithmetic

Hardware Testing and Designing for Testability

Computer Architecture

ECEG-3202 Computer Architecture and Organization

Information Redundancy Fault Tolerant Computing

ECEG-3202 Computer Architecture and Organization

Software Verification and Validation

Software Verification and Validation

Topics Switch networks. Combinational testing..

ECE 352 Digital System Fundamentals

NAND and XOR Implementation

Software Verification and Validation

2019/5/8 BitCoding Network Traffic Classification Through Encoded Bit Level Signatures Author: Neminath Hubballi, Mayank Swarnkar Publisher/Conference:

Fault Tolerant Systems in a Space Environment

ECE 352 Digital System Fundamentals

Computer Architecture

Presentation transcript:

TOPIC : Introduction to Compression Techniques UNIT 5 : BIST and BIST Architectures Module 5.4 Compression Techniques

Necessity of Compression Techniques In general, after applying the test vector set to the circuit under test (CUT), the output response is compared with the correct outputs. The comparison is done bit by bit. For each vector in the test set, there is a corresponding correct output. So, there can be many outputs. These correct outputs are computed before testing and saved.

Contd … Since there are many test vectors, the outputs require significant memory storage. The cost of memory storage might be more than the cost of circuit. Hence, there is a necessity for another approach which requires less memory storage. Compression techniques can be used to reduce memory storage.

Signature (Compressed form) It is the information saved about the output response in a compressed form. The test process is carried out by comparing the already computed correct signature with the observed signature. The process of reducing the output response to a signature is known as compression.

Testing using Signature The testing is similar to the conventional, but here the signatures are compared instead of the outputs directly. But it comes with trade-off as signature processing costs.

Requirements of compression procedure The length of the signature should be logarithmic factor of length of the output, so that there is significant compression. The signatures should be different for faulty and fault- free cases to ensure no loss of information. It should not introduce any signal delays. The compression circuit should be such that it can be included in the BIST logic of the CUT.

Different Compression Techniques The different compression techniques that can be used are as follows: One’s count compression Transition-count compression Parity-check compression