Investigation of a constant behavior of aliasing errors in signature analysis due to the use of different ordered test-patterns in LFSR based testing techniques

https://doi.org/10.1016/S0026-2714(02)00018-5Get rights and content

Abstract

In this paper, the impact of the change of the order of the test patterns, on error masking behavior of signature analysis scheme used in an linear feedback shift register (LFSR) based testing technique, is investigated. The investigation is carried-out through an extensive simulation study of the effectiveness of an LFSR based testing technique. The results of the simulation study show that the probability of aliasing errors remains unchanged although the changed order of the input test-sequences were applied to the circuit under test.

Introduction

Over the years there has been a remarkable growth in very large scale integration (VLSI) techniques. Tremendous advances in fabrication technologies have led to increased integrated circuit (IC) densities. As a consequence of higher integration densities, circuits have become very complex. To verify their correct functioning, thorough tests are required for ICs. The costs involved in testing of even large scale integration (LSI) chips are a substantial portion of the total manufacturing cost [1], [2], [3]. Further, advances in IC technology are occurring at a rate faster than those in test technology. A direct consequence of this is that those testing methods, which are inadequate even for LSI circuits, are unable to cope with the increased circuit sizes because of higher chip densities [2], [3].

A major problem in testing of large circuits is, the generation of test-stimuli for the achievement of an acceptable level of testing. Conventionally, test-pattern generation and fault simulation mechanisms are intertwined and are continued till the desired fault coverage for the circuit under test (CUT) is achieved [1], [2], [3], [4], [5]. In general, it has been shown that the computational complexity of test-generation is proportional to Gc3 where, Gc is the gate count. Furthermore, the process of fault-simulation is ten times more complex than that of the logic simulation. Also, the complexity of fault-simulation itself grows proportionally to the square of the Gc [1], [2]. These above discussed factors have led to the postulation of alternative strategies and the most successful amongst them has been the design for testability (DFT) approach [1], [2], [3], [4], [5], [6], [7]. The objective of DFT is to integrate the design and test processes leading to circuits, which are inherently testable at minimum cost. i.e. the objective is to follow the rule expressed in Eq. (1), below.Cost(design+test)⩽(Costdesign+Costtest).

Even with structured DFT methodology, the problem of test-generation through algorithmic means still remains. Coupled with this is the handling of large volume of response data. Both of these factors are the functions of size and complexity of the circuit. One possible solution for this is the approach of built-in test (BIT). The basic idea of BIT is to incorporate the test functions in the hardware itself. This is feasible in view of the availability of larger silicon real estate on the chip. As a natural outcome of the structured design approach for DFT, self-testing has drawn considerable attention. The end result is the built-in self-test (BIST) approach. Currently, BIST has promised to be an effective tool for tackling test problems of VLSI chips and systems [2], [4], [5], [6], [7].

In particular, pseudo-random test pattern (PRTP) generation followed by the compression of response data by signature analysis (SA) has become a standard form of testing in BIST environment [2], [4], [5]. Linear feedback shift registers (LFSRs) have been proposed as an integral part of a sequential logic design, such that they can be used to both generate and compact the results of a test. Undoubtedly, an LFSR based PRTP generation is an extremely simple tool for generating any length of a desired sequence of the test-stimuli. Such a desired sequence of the PRTP can be obtained by the predetermined `initial loading' of the LFSRs. Difficulty arises when the resulting response data obtained from the CUT is compressed into small signatures using SA scheme. Although, this scheme is easily implemented by an LFSR, but this leads to loss of information, due to the erroneous response patterns that gets compressed into the same signature as the fault-free signature of the CUT. Thus, some of the faults might go undetected due to this masking phenomenon. This problem of error masking is called `aliasing' [4].

Methods to determine the extent of fault-escape caused by a response compressor are not readily available. However, various attempts [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23] have been made to analyze and improve the basic signature scheme. The end goal of the above schemes, individually, or with a combination of these, is to reduce the deception volume [9]. Furthermore, a close look of each of the individual techniques, suggested in the research papers [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23] reveals that the level of aliasing errors in LFSR based testing approach may be reduced by implementation of either of the following schemes individually or their combinations. The schemes are:

  • Use of primitive characteristic polynomials in the LFSRs of PRTP generators (PRTPGs).

  • Use of different ordered PRTPs.

  • Use of an incremented bit-length size of LFSR in SA schemes.

  • Use of primitive characteristic polynomials in the LFSRs of SA schemes.


In the research papers [11], [16], [18], [19], [20], [21], [23] it is conjectured that the order of the test patterns applied to the CUT may change the level of the probability of aliasing errors. Whereas, this paper, investigates a critical condition in context to the role of different ordered PRTPs on the effectiveness of an LFSR based testing technique. The simulation study made through this paper reveals that the change of the order of the test-patterns do not have any impact on the effectiveness of an LFSR based testing technique i.e. the behavior of fault-masking phenomenon (level of aliasing errors) remains unchanged.

Section snippets

Preliminary mathematical details and basic definitions related to LFSRs [24,25]

Let A represent the state transition matrix, describing the n-stage LFSR of Fig. 1, where the states of the flip-flops (which is effectively the contents of the LFSR) at any time t be represented by vector [Y(t)]=[y1(t),y2(t),..,yj(t),..,yn(t)]. Thereby, each yj represents the state of the jth stage of the LFSR. In Fig. 1, the LFSR stage is numbered from 1 to n, proceeding in the same direction as the shifting occurs. Let the present state of the LFSR be represented by [Y(t)] and, one clock

Development of simulation study tool

This section is aimed to describe developed algorithmic procedures for the realization of the necessary elements required for the simulation study of the effectiveness of LFSR based test models.

Simulation experiment's set-up

Using an external EX-OR type structure of a n-bit PRTPG, the Algorithm 1 (Section 3.1) is used to collect the samples of all possible different ordered PRTPs of length L. Each set of these PRTPs is fed in parallel to the n-inputs of the CUT. The CUT that uses gate level description where, single stuck-at-faults (s-a-0 and s-a-1) are postulated on individual branches in its simulation produces the response data [D]. In the case of multi-outputs CUT a single bit of response data [D*] is obtained

Results

A large set of different combinational circuits (Table 1) is considered in the simulation experiment. The procedure described above in Section 4 (Algorithm 3), the probability of aliasing errors, which remains same for each possible change in the order of the PRTPS is observed. In the interest of the space only a few results; for Circuits 1–4 (Table 1) are demonstrated in Fig. 3, Fig. 4, Fig. 5 respectively. Each of the figures (Fig. 3, Fig. 4, Fig. 5) demonstrates the behavior of aliasing

Conclusion and discussions

It has been demonstrated through this simulation study that the change of the order of test-stimuli applied to the CUT does not have any impact on the effectiveness of the LFSR based testing techniques. Throughout the experiment the changes in the level of aliasing errors are noted while the changed pair of characteristic polynomials are used in PRTPG and SA scheme. However, for a set of characteristic polynomials used in PRTPG and SA is unable to change the level of aliasing errors. Fig. 3,

References (25)

  • E.I. Muehldrof et al.

    LSI logic testing an overview

    IEEE Trans Comput

    (1981)
  • T.W. Williams

    VLSI testing

    IEEE Comput

    (1984)
  • H. Bierman

    VLSI test gear keeps with chip advances––Special Report

    Electronics

    (1984)
  • E.J. Mccluskey

    Built-in self-test techniques

    IEEE Des Test Comput

    (1985)
  • Ahmad A. On a design approach for reducing aliasing errors and achieving higher testability goals in LFSR based testing...
  • R.G. Bennetts

    Design of testable logic circuits

    (1984)
  • A. Ahmad et al.

    Effectiveness of multiple compressions of multiple signatures

    Intl J Electron

    (1989)
  • J.E. Smith

    Measure of effectiveness of fault in signature analysis

    IEEE Trans Comput

    (1980)
  • V.K. Agrawal
  • Hassan SZ, Mccluskey EJ. Increased fault-coverage through multiple signatures. Digest of 14th Intl Symposium on...
  • Bhavsar DK, Krishnamurthy B. Can we eliminate fault escape in self-testing by polynomial division? Proc 1984 IEEE Intl...
  • T.W. Williams et al.

    Bounds and analysis of aliasing errors in linear feedback shift registers

    IEEE Trans Comput Aided Des

    (1988)
  • Cited by (2)

    View full text