Memory Test. Built-In Self Test (BIST) Introduction for Memory Test.

Slides:



Advertisements
Similar presentations
Machine cycle.
Advertisements

Presenter: Jyun-Yan Li On the Generation of Functional Test Programs for the Cache Replacement Logic W. J. Perez H. Universidad del Valle Grupo de Bionanoelectrónica.
MEMORY BIST by: Saeid Hashemi Mehrdad Falakparvaz
Lectures on File Management
V. Vaithianathan, AP/ECE
TOPIC : Finite State Machine(FSM) and Flow Tables UNIT 1 : Modeling Module 1.4 : Modeling Sequential circuits.
1 Virtual Memory Management B.Ramamurthy. 2 Demand Paging Main memory LAS 0 LAS 1 LAS 2 (Physical Address Space -PAS) LAS - Logical Address.
Segmentation and Paging Considerations
1 EE 587 SoC Design & Test Partha Pande School of EECS Washington State University
Copyright 2005, Agrawal & BushnellVLSI Test: Lecture 21alt1 Lecture 21alt BIST -- Built-In Self-Test (Alternative to Lectures 25, 26 and 27) n Definition.
Memory Management Design & Implementation Segmentation Chapter 4.
Modern Information Retrieval
Memory Management (II)
Design for Testability Theory and Practice Lecture 11: BIST
1 Chapter Seven Large and Fast: Exploiting Memory Hierarchy.
Memory Organization.
1 Chapter 8 Virtual Memory Virtual memory is a storage allocation scheme in which secondary memory can be addressed as though it were part of main memory.
Lecture 27 Memory and Delay-Fault Built-In Self-Testing
Design Technology Center National Tsing Hua University Flash Memory Built-In Self-Test Using March-Like Algorithms Jen-Chieh Yeh, Chi-Feng Wu, Kuo-Liang.
Virtual Memory I Chapter 8.
Virtual Memory Management B.Ramamurthy. Paging (2) The relation between virtual addresses and physical memory addres- ses given by page table.
SCORPION : A New Approach to Design Reliable Real-Time Speech Recognition Systems F. Vargas, R. D. Fagundes, D. Barros Jr. Catholic.
ELEN 468 Lecture 251 ELEN 468 Advanced Logic Design Lecture 25 Built-in Self Test.
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.
1 Sec (2.3) Program Execution. 2 In the CPU we have CU and ALU, in CU there are two special purpose registers: 1. Instruction Register 2. Program Counter.
Compressed Instruction Cache Prepared By: Nicholas Meloche, David Lautenschlager, and Prashanth Janardanan Team Lugnuts.
UNIT 2 Memory Management Unit and Segment Description and Paging
Secure Embedded Processing through Hardware-assisted Run-time Monitoring Zubin Kumar.
TOPIC : Types of fault simulation
Fault models Stuck-at Stuck-at-1 Reset coupling 0 0 Set coupling Inversion coupling Transition  /0 0 1 Transition  /1 1.
Cyclic redundancy codes Circuit elements in Digital computations Prof. Seok-Bum Ko Mehrnoosh Janbakhsh Jan29, 2010.
Introduction To PROLOG World view of imperative languages. World view of relational languages. A PROLOG program. Running a PROLOG program. A PROLOG.
Fall 2000M.B. Ibáñez Lecture 17 Paging Hardware Support.
1 Virtual Memory Chapter 8. 2 Hardware and Control Structures Memory references are dynamically translated into physical addresses at run time –A process.
Computer Studies (AL) Memory Management Virtual Memory I.
TOPIC : Introduction to Compression Techniques UNIT 5 : BIST and BIST Architectures Module 5.4 Compression Techniques.
Memory Cell Operation.
StrideBV: Single chip 400G+ packet classification Author: Thilan Ganegedara, Viktor K. Prasanna Publisher: HPSR 2012 Presenter: Chun-Sheng Hsueh Date:
Virtual Memory 1 1.
Wnopp Memory device Introduction n Memory Cell n Memory Word n Byte n Capacity n Address n Read Operation n Write Operation n Access Time n Volatile.
Saket Mengle Paging refers to the process of managing program access to virtual memory pages that do not currently reside in RAM.
Chapter5: Synchronous Sequential Logic – Part 1
Lectures 8 & 9 Virtual Memory - Paging & Segmentation System Design.
07/11/2005 Register File Design and Memory Design Presentation E CSE : Introduction to Computer Architecture Slides by Gojko Babić.
Memory Test. - Stuck-at faults, - Transition faults, - Coupling faults, - Decoder faults, - Read/Write Logic faults. Types of faults afecting RAMs:
Virtual Memory.
Computer Architecture & Operations I
Cache Memory.
Memory Interfacing.
ITEC 202 Operating Systems
COMBINED PAGING AND SEGMENTATION
Soft-Error Detection through Software Fault-Tolerance Techniques
Hardware Testing and Designing for Testability
CS 430: Information Discovery
VLSI Testing Lecture 14: Built-In Self-Test
ECE 434 Advanced Digital System L18
Flash EEPROM Emulation Concepts
RAID RAID Mukesh N Tekwani
Physical Database Design
Information Redundancy Fault Tolerant Computing
Chap. 12 Memory Organization
High-Level Synthesis for On-line Testability
RAID RAID Mukesh N Tekwani April 23, 2019
Fault Tolerant Systems in a Space Environment
Course Code 114 Introduction to Computer Science
Virtual Memory 1 1.
Sec (2.3) Program Execution.
Presentation transcript:

Memory Test

Built-In Self Test (BIST) Introduction for Memory Test

Built-In Self Test (BIST) a) Mscan Test

Built-In Self Test (BIST) b) Marching Test

c) Transparent BIST Test on the field Transparent Built-In Self Test is a test algorithm that is periodically executed on the field in order to verify the integrity of large amounts of critical data stored on mass memory systems Built-In Self Test (BIST)

Main characteristics: 1)Minimum area overhead 1) Minimum area overhead: this approach is one of the best choices found in the literature in terms of area overhead and types of faults detected in memory structures. E.g., authors claim an area overhead of 1.2% due to the inclusion of Transparent BIST in a 128Kbytes X 8bytes SRAM (this value decreases as the RAM size increases). Built-In Self Test (BIST) c) Transparent BIST Test

Main characteristics: 2)High capability of fault detection 2) High capability of fault detection: by indicating the occurrence of stuck-at faults, transition faults,coupling faults, decoder faults and read/write logic faults. Built-In Self Test (BIST) c) Transparent BIST Test

Main characteristics: 3)Short “down times” 3) Short “down times”: that are periodically required to check the functionality of mass memory systems used in real-time applications. The Transparent BIST approach presents the incomparable advantage of preserving the contents of the RAM memory after testing. Thus, this approach is very suitable for periodic testing since we do not need to save the memory contents before the test session and to restore them at the end of this session. Built-In Self Test (BIST) c) Transparent BIST Test

 execution time Built-In Self Test (BIST) c) Transparent BIST Test Table 1. Transparent BIST Algorithm

The data read during execution of sequences S1’ through S4’ of the Signature Prediction Algorithm (Table 1) are sometimes inverted in order to match the data read during the execution of sequences S1 through S4 of the Transparent BIST Algorithm (Table 1).  execution time Built-In Self Test (BIST) c) Transparent BIST Test Table 2. Signature Prediction Algorithm