Testing of PLA and PAL. 111 +V... 0...... y1y1 y2y2 y m x 1 x 2 x n + V Buffer ANDOR......... x 1 x 2 x n y1y1 y2y2 y m PAL/PLA structure.

Slides:



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

Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 2 – Combinational.
MEMORY BIST by: Saeid Hashemi Mehrdad Falakparvaz
1 The 2-to-4 decoder is a block which decodes the 2-bit binary inputs and produces four output All but one outputs are zero One output corresponding to.
Sahar Mosleh PageCalifornia State University San Marcos 1 Introductory Concepts This section of the course introduces the concept of digital circuits and.
Computer Interfacing and Protocols
Overview Part 2 – Combinational Logic Functions and functional blocks
Combinational Circuits
Chapter 7 Henry Hexmoor Registers and RTL
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.
Copyright 2001, Agrawal & BushnellVLSI Test: Lecture 261 Lecture 26 Logic BIST Architectures n Motivation n Built-in Logic Block Observer (BILBO) n Test.
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 9 Programmable Configurations Read Only Memory (ROM) – –a fixed array of AND gates.
1 EE 587 SoC Design & Test Partha Pande School of EECS Washington State University
Overview Part 3 – Additional Gates and Circuits 2-8 Other Gate Types
CHAPTER 2 Digital Combinational Logic/Arithmetic Circuits.
Copyright 2005, Agrawal & BushnellVLSI Test: Lecture 21alt1 Lecture 21alt BIST -- Built-In Self-Test (Alternative to Lectures 25, 26 and 27) n Definition.
Parity. 2 Datasheets TTL:  CMOS: 
Documentation Standards Programmable Logic Devices Decoders
Parity. 2 Datasheets TTL:  CMOS: 
Design for Testability Theory and Practice Lecture 11: BIST
1 Design For Debug Using DAFCA system Gadi Glikberg 15/6/06.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
ELEN 468 Lecture 251 ELEN 468 Advanced Logic Design Lecture 25 Built-in Self Test.
TOPIC : BILBO BIST Architectures UNIT 5 : BIST and BIST Architectures Module 5.2 BIST.
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 AND DATA COMPRESSION 1 JTAG COURSE spring 2006 Andrei Otcheretianski.
Logic Gates Combinational Circuits
Data link layer: services
Generating Random Numbers in Hardware. Two types of random numbers used in computing: --”true” random numbers: ++generated from a physical source (e.g.,
Figure to-1 Multiplexer and Switch Analog
Digital Fundamentals Floyd Chapter 1 Tenth Edition
Testimise projekteerimine: Labor 2 BIST Optimization
Finite State Machines. Binary encoded state machines –The number of flip-flops is the smallest number m such that 2 m  n, where n is the number of states.
TOPIC : Types of fault simulation
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals with PLD Programming.
Digital Logic Design Week 3
ECE 553: TESTING AND TESTABLE DESIGN OF DIGITAL SYSTEMS
1 EE 587 SoC Design & Test Partha Pande School of EECS Washington State University
Linear Feedback Shift Register. 2 Linear Feedback Shift Registers (LFSRs) These are n-bit counters exhibiting pseudo-random behavior. Built from simple.
Unit 5 Lecture 2 Error Control Error Detection & Error Correction.
TOPIC : Signature Analysis. Introduction Signature analysis is a compression technique based on the concept of (CRC) Cyclic Redundancy Checking It realized.
TOPIC : Controllability and Observability
© 2009 Pearson Education, Upper Saddle River, NJ All Rights Reserved Floyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
CS/EE 3700 : Fundamentals of Digital System Design
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.
WEEK #11 FUNCTIONS OF COMBINATIONAL LOGIC (PART 4)
1 EE121 John Wakerly Lecture #5 Documentation Standards Programmable Logic Devices Decoders.
Combinational Logic: Other Gate Types
Gunjeet Kaur Dronacharya Group of Institutions. Outline I Random-Access Memory Memory Decoding Error Detection and Correction Read-Only Memory Programmable.
POWER OPTIMIZATION IN RANDOM PATTERN GENERATOR By D.Girish Kumar 108W1D8007.
Combinational Logic Design
Combinational Circuits
Hardware Testing and Designing for Testability
Overview Part 1 – Gate Circuits and Boolean Equations
Combinational Logic Circuits
COUPING WITH THE INTERCONNECT
VLSI Testing Lecture 14: Built-In Self-Test
FUNCTION OF COMBINATIONAL LOGIC CIRCUIT
CPE/EE 428/528 VLSI Design II – Intro to Testing (Part 3)
CPE/EE 422/522 Advanced Logic Design L02
Sequential circuits and Digital System Reliability
ECE434a Advanced Digital Systems L02
Lecture 5 Fault Modeling
EET107/3 DIGITAL ELECTRONICS 1
King Fahd University of Petroleum and Minerals
Multiplexers Anindya IE CSE.
Sungho Kang Yonsei University
Overview Part 3 – Additional Gates and Circuits 2-8 Other Gate Types
Lecture 26 Logic BIST Architectures
Presentation transcript:

Testing of PLA and PAL V y1y1 y2y2 y m x 1 x 2 x n + V Buffer ANDOR x 1 x 2 x n y1y1 y2y2 y m PAL/PLA structure

111 +V x 1 x 2 x 3 0 y 1 y 2 y 1 = x 1 x 2 x 3 + x 1 x 2 x 3 + x 1 x 2 y 2 = x 1 x 2 x 3 + x 1 x 2 Example.

1.Permanent constant faults; 2.Short-circuits; 3.Crosspoint Faults ; appearance of CP-s in the AND array;; disappearance of CP-s from the AND array; appearence of CP-s in the OR array; disappearance of CP-s from the OR array. Models of fault in PLA-s and PAL-s fXfX s-a-1s-a-0 f1X f2X Short Classical model of fault: constant 1 and 0 (Stuck-at-0, Stuck-at-1, s-a-0, s-a-1) f1 X X

111 +V x 1 x 2 x 3 0 y 1 y 2 y 1 = x 1 x 2 x 3 + x 1 x 2 x 3 + x 1 x 2 y 2 = x 1 x 2 x 3 + x 1 x 2 s-a-1 X 3 s-a-1fault y 1 = x 1 x 2 + x 1 x 2 x 3 + x 1 x 2 y 2 = x 1 x 2 + x 1 x 2 Permanent constant faults in PLA/PAL-s

Crosspoint Faults Appearance of CP-s to in the AND array 111 +V x 1 x 2 x 3 0 y 1 y 2 y 1 = x 1 x 2 x 3 + x 1 x 2 x 3 + x 1 x 2 y 2 = x 1 x 2 x 3 + x 1 x 2 Unnecessary CP y 1 = x 1 x 2 x 3 + x 1 x 2 x 3 + x 1 x 2 x 3 y 2 = x 1 x 2 x 3 + x 1 x 2 x 3 Unnecessary variable Shrinkage fault Carnaugh Map x1x x2x3x2x3 y2y x1x x2x3x2x3 y2y2 FaultlessFaulty

Disappearance of CP-s from the AND array 111 +V x 1 x 2 x 3 0 y 1 y 2 y 1 = x 1 x 2 x 3 + x 1 x 2 x 3 + x 1 x 2 y 2 = x 1 x 2 x 3 + x 1 x 2 CP does not exist y 1 = x 1 x 2 x 3 + x 1 x 2 x 3 + x 1 x 2 y 2 = x 1 x 2 x 3 + x 1 Growth fault Carnaugh Map x1x x2x3x2x3 y2y x1x x2x3x2x3 y2y2 FaultlessFaulty CP does not exist

Appearance of a new CP to the OR-array 111 +V x 1 x 2 x 3 0 y 1 y 2 y 1 = x 1 x 2 x 3 + x 1 x 2 x 3 + x 1 x 2 y 2 = x 1 x 2 x 3 + x 1 x 2 Unnecessary CP y 1 = x 1 x 2 x 3 + x 1 x 2 x 3 + x 1 x 2 y 2 = x 1 x 2 x 3 + x 1 x 2 + x 1 x 2 x 3 Carnaugh Map x1x x2x3x2x3 y2y x1x x2x3x2x3 y2y2 FaultlessFaulty Appearance fault

111 +V x 1 x 2 x 3 0 y 1 y 2 y 1 = x 1 x 2 x 3 + x 1 x 2 x 3 + x 1 x 2 y 2 = x 1 x 2 x 3 + x 1 x 2 CP does not exist y 1 = x 1 x 2 x 3 + x 1 x 2 x 3 + x 1 x 2 y 2 = x 1 x 2 x 3 Carnaugh Map x1x x2x3x2x3 y2y x1x x2x3x2x3 y2y2 FaultlessFaulty Disappearance fault Disapperance of the CP from the OR-array CP does not exist

Missing CP-s are equivalent to some constant faults (Stuck-at-0/1) but additional CP-s do not corrspond to that model. n – number of inputs m – number of terms k – number of outputs (2n + k) – different single and manifold CP faults different single and manifold CP faults (2n + k)m CP faults may be untestifyiable in case of excessive functions For example: y 1 = x 1 + x 2 + x 1 x 2 = x 1 + x 2 The missing of CP corresponding to whichever variable is not testifyiable in the AND array. The missing of CP corresponding to this term is not testifyiable in the OR array.

1.Traditional methods for circuits equivalent to PAL/PLA-s; 2.Random testing 3.Exhaustive testing 4.Semirandom methods 5.Deterministic Methods Generation of tests for PLA-s and PAL-s Traditional methods for equivalent circuits. & & 1 Cons: 1.Ineffective due to convergent branching 2. CP faults cannot be described as traditional s-a-0/1 faults.

Random testing & X s-a-0 00 & X s-a Discovery of the fault in AND array / /0 Bringing the impact of the fault to the output through OR array PAL/PLA Reactions Random combinations Cons: 1. A very large number of tests as in AND array combinations where only one input is 1 and the rest are 0s can be used as tests. 2.A very large number of tests as the transport through the OR array requires that one input equals 1 and the rest are 0s.

Exhaustive testing and semirandom methods PAL/PLA Reactions All possible combinations Cons: A large number of tests when real arrays are considered (for example, 50 inputs, 67 outputs, 190 terms) Exhaustive testing Semirandom method PAL/PLA Reactions Generator of pseudorandom numbers & Random numbers are not used. In stead, numbers with only one 0 are used.

Deterministic Test Generation Special algorithms oriented at the structure of the array and testing of CP-s V x 1 x 2 x 3 0 y 1 y 2 y 1 = x 1 x 2 x 3 + x 1 x 2 x 3 + x 1 x 2 y 2 = x 1 x 2 x 3 + x 1 x 2 Example: let us test whether x 1 x 2 has been Added in the function y 2 with CP x 3. Let us define the operation: a # b = a b Activating the impact of the fault: a = term that can be tested without faults b = term than can be tested with faults Example. x 1 x 2 # x 1 x 2 x 3 = x 1 x 2 (x 1 x 2 x 3 ) = x 1 x 2 x 3 Transport of the impact of the fault to the output: a =result of the previous operation, b =functiwithout the tested term Example.x 1 x 2 x 3 # x 1 x 2 x 3 = x 1 x 2 x 3 (x 1 x 2 x 3 ) = x 1 x 2 x 3 Test : x 1 = 1 x 2 = 1 x 3 = /

Testable PLA Design What is the objective? Concurrent testing Fault masking Special Design Self-testing Test generation Yes No Yes No Yes No YesNo Must be taken into consideration: 1.Indicators of testability; 2.Impact on the original design; 3.Requirements for the testing environment; 4.Cost of design

Buffer ANDOR x 1 x 2 x n y1y1 y2y2 y m Concurrent testing of PAL/PLA-s I Examples of testable PLA/PAL-s TSC Two-rail Checker fg Additional line TSC 1-out-of-m code checker Parity check fg faultless/faulty Totaly Self Cheking (TSC) Two-rail Checker x0x0 x1x1 y0y0 y1y1 x0x0 x1x1 y0y0 y1y1 f TSC Two-rail Checker fg g If x 0 = y 0 and x 1 = y 1 then f = g

Concurrent testing of PAL/PLA-s I (using the Berger code) Buffer ANDOR x 1 x 2 x n y1y1 y2y2 y m Additional lines TSC Two-rail Checker fg Control code generator Inverse value of the control code Control code

Berger code Orders of infoOrder of control (number of 0s in the code) 011 Control order generator Orders of info Orders of control Comparison scheme True/false Modifyied Berger code for a set of functions x 1 x x3x4x3x4 y1y x 1 x x3x4x3x4 y3y x 1 x x3x4x3x4 y2y x 1 x x3x4x3x4 c 1 c

PAL/PLA testable with universal tests ANDOR x 1 x n y1y1 y2y2 y ky k c1c1 c2c2 s1s1 smsm... s m+1 Parity check z1z1 Additional line Parity check Additional line z2z2 Selection of terms Decoder of the modified inputs Decoder of the modified inputs 1 & & b 2i-1 b 2i xixi c1c1 c2c2 It is possible to test an array without knowing how it has been programmed. The testing is not concurrent.

Universal tests e m = 0, if m is odd 1, if m is even The length of the tests is 1+m+n, where m is the number of terms and n is that of inputs.

A built-in Self-Testable PLA with Cumulative Parity Comparision AND (the number of used CP-s at each line must be odd)) OR (the number of used CP-s mt each line must be even) x 1 x n y1y1 y2y2 y ky k c1c1 c2c2 s1s1 smsm... s m+1 Additional line Parity check Additional line Selection of terms Decoder of the modified inputs xor T D z While transmitting universal tests (n+m+1) the trigger takes at each test series the opposite value according to the previous series.

Methods using signature LFSR - Linear Feedback Shift Register TT + TT + Signature Analyzer TT + TT +++ Parallel. Series TTTT + + Signal from the checked object Signals from the checked object

Buffer ANDOR x 1 x 2 x n y1y1 y2y2 y m LFSR (Generator of pseudorandom numbers) Signature analyzer I Signature analyzer II All possible input combinations may be used instead of the generator of pseudorandom numbers

PLA/PAL with BILBO-s. BILBO – Built-in Logic-Block Observer LFSR that can be activated as the generator of pseudorandom numbers or as signature analyzer (depending on the conditions chosen) Buffer ANDOR y1y1 y2y2 y m BILBO I BILBO II BILBO III...x 1 x 2 x n

More methods for improving the testability 1. Counting of CP-s. Presupposes the conductivity of bit lines and term lines. Presupposes that the expected CP numbers are known (functioning array) 2. feedback from the signature analyzer to the inputs (to the LFSR generating pseudorandom values). Thus ate these blocks united into one. 3. several signature analyzers are used for testing both the AND and OR part. For example, one is used for testing even bit lines and the other for odd. It results in the better use of the chip area as the analyzer behind the bit lines requires more space than the bit lines. 4. AND and OR arrays are divided into parts that enables to test them simultaneously. Presupposes that additional requirements are set for thr programming of PAL/PLA-s.