Pattern generation for a deterministic BIST scheme
Recently a deterministic built-in self-test scheme has been presented based on reseeding of multiple-polynomial linear feedback shift registers. This scheme encodes deterministic test sets at distinctly lower costs than previously known approaches. In this paper it is shown how this scheme can be su...
Saved in:
Published in | Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design pp. 88 - 94 |
---|---|
Main Authors | , , , |
Format | Conference Proceeding |
Language | English |
Published |
Washington, DC, USA
IEEE Computer Society
01.12.1995
|
Series | ACM Conferences |
Subjects | |
Online Access | Get full text |
ISBN | 9780818672132 0818672137 |
DOI | 10.5555/224841.224865 |
Cover
Summary: | Recently a deterministic built-in self-test scheme has been presented based on reseeding of multiple-polynomial linear feedback shift registers. This scheme encodes deterministic test sets at distinctly lower costs than previously known approaches. In this paper it is shown how this scheme can be supported during test pattern generation. The presented ATPG algorithm generates test sets which can be encoded very efficiently. Experiments show that the area required for synthesizing a BIST scheme that encodes these patterns is significantly less than the area needed for storing a compact test set. Furthermore, it is demonstrated that the proposed approach of combining ATPG and BIST synthesis leads to a considerably reduced hardware overhead compared to encoding a conventionally generated test set. |
---|---|
ISBN: | 9780818672132 0818672137 |
DOI: | 10.5555/224841.224865 |