DLBIST Method: Deterministic Built-In Self-Test

09.2000 - 09.2003, Philips - Project

Short Description

The accelerated increase of the integrated circuits (IC) size and of the gap between the internal clock frequencies and the I/O frequencies makes the external IC testing more and more difficult and costly due to the corresponding rises of the tester memory requirements and of the test time. In this context, built-in self-test (BIST) solutions became an attractive alternative, since they allow precision measurements on-chip in a relatively short time.

The picture above sketches the structure STUMPS (self-test using MISR and parallel shift register sequence generator) architecture of the considered f the deterministic logic BIST (DLBIST) approach. Here a linear feedback shift register (LFSR) generates a pseudo-random sequence, which is mapped afterwards to a deterministic sequence with the help of a module, implementing a bit flipping function (BFF), and of a couple of XOR slots. This deterministic sequence is filled in the circuit logic, assumed to be full scanable and BIST ready (no unknown value can be propagated to the signature analyser, which is a multi-input shift register (MISR)). The test is controlled with the help of a pattern counter (bist_patcnt), of a bit counter (bist_patcnt) and of a control unit (bist_ctrl). The interaction of the whole architecture with the environment is coordinated by a test controlling block (TCB).

The goal of this project is to develop new ideas and approaches to enhance the performance and the versatility of the Deterministic Logic Self-Test. The topics addressed in this project, carried out by the University of Stuttgart and Philips, include issues like Improving Pattern Embedding and cpu Run-Time, the implementation of a Built-Out Self-Test (BOST), the synthesis of an X-Masking Logic (XML), or the enlargement of the covered fault model space towards delay faults. One of the goals behind all these is to increase the performance of the DLBIST facility, as integrated in the Philips computer aided test (CAT) flow.

Short Presentation of the Topic: Improving Pattern Embedding and cpu Run-Time

With the exception of the BFF module, whose functionality is suggested by the picture below, the synthesis of all the other DLBIST modules is more or less straightforward. Unfortunately generating the BFF for very large designs can take weeks or even months. Due to this reason the BFF synthesis became the bottleneck of the Philips CAT flow and of enlarging the DLBIST fault model space to include also the gate-delay faults. Related to the second requirement, one expects a significant increase of the number of deterministic patterns, which should be embedded in pseudo-random ones, so the reduction of the cpu run-time becomes more critical for a delay test using the DLBIST approach.

The goal of this research topic is to reduce the time complexity of the BFF generation, such that it could be performed in maximum one day, independently of the design size and of the targeted fault efficiency. As well, the size of the BFF logic should remain as small as possible.

Journals and Conference Proceedings

    Workshop Contributions

      Hans-Joachim Wunderlich (i.R.)
      Prof. Dr. rer. nat. habil.

      Hans-Joachim Wunderlich (i.R.)

      Heading the Research Group Computer Architecture

      To the top of the page