Fast signature computation for BIST linear compactors

Signature computation for linear compactors in a BIST environment is a computationally intensive process. In this paper, a fast compaction simulation algorithm is presented which uses superposition and look-up tables. While keeping memory requirements reasonable, this algorithm has a speedup advantage of at least one order of magnitude over traditional algorithms, and offers a threefold speedup over recently published "fast" algorithms. Our algorithm is also applicable to any linear compactor - while existing algorithms are restricted to only one type of compactor. Simulation results comparing the speed and memory requirements of the proposed compaction algorithm to that of existing compaction algorithms are given. >

[1]  D. Lambidonis,et al.  FAST SIGNATURE COMPUTATION FOR LINEAR COMPACTORS , 1991, 1991, Proceedings. International Test Conference.

[2]  Kewal K. Saluja,et al.  An Efficient Method for Computation of Signatures , 1992, The Fifth International Conference on VLSI Design.

[3]  Dilip V. Sarwate.  Computation of cyclic redundancy checks via table look-up , 1988, CACM.

[4]  Piero Olivo,et al.  Analysis and Design of Linear Finite State Machines for Signature Analysis Testing , 1991, IEEE Trans. Computers.

[5]  Melvin A. Breuer,et al.  Digital systems testing and testable design , 1990 .

[6]  T. Williams,et al.  Aliasing errors in linear automata used as multiple-input signature analyzers , 1990 .

[7]  J. Nash.  Compact Numerical Methods for Computers , 2018 .

[8]  Georgia Griffiths,et al.  The tea-leaf reader algorithm: an efficient implementation of CRC-16 and CRC-32 , 1987, CACM.

[9]  Sl Hurst.  A Hardware Consideration of CALBO Testing , 1989 .

[10]  David Bryan,et al.  Combinational profiles of sequential benchmark circuits , 1989, IEEE International Symposium on Circuits and Systems,.

[11]  Janusz Rajski,et al.  A method of fault simulation based on stem regions , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Wilfried Daehn,et al.  Bounds and analysis of aliasing errors in linear feedback shift registers , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  R. McLeod,et al.  Cellular automata circuits for built-in self test , 1990 .

[14]  Solomon W. Golomb,et al.  Shift Register Sequences , 1981 .

[15]  Premachandran R. Menon,et al.  Critical Path Tracing - An Alternative to Fault Simulation , 1983, 20th Design Automation Conference Proceedings.

[16]  Prab Varma,et al.  A Fast Signature Simulation Tool for Built-In Self-Testing Circuits , 1987, 24th ACM/IEEE Design Automation Conference.

[17]  J. Mucha,et al.  Built-In Test for Complex Digital Integrated Circuits , 1979, Fifth European Solid State Circuits Conference - ESSCIRC 79.

[18]  André Ivanov,et al.  A quasi-optimal scheduling of intermediate signatures for multiple signature analysis compaction testing schemes , 1995, J. Electron. Test..