A Fast Signature Computation Algorithm for LFSR

A multiple-input signature register (MISR) com- putation algorithm for fast signature simulation is proposed. Based on the table look-up linear compaction algorithm and the modularity property of a single-input signature register (SISR), some new accelerating schemes—partial-input look-up tables and flying-state look-up tables—are developed to boost the signature computation speed. Mathematical analysis and simulation results show that this algorithm has an order of magnitude speedup without extra memory requirement compared with the original linear compaction algorithm. Though this algorithm is derived for SISR, a simple conversion scheme exists that can convert in- ternal-EXOR MISR to SISR. Consequently, fast MISR signature computation can be done.

[1]  Dong Sam Ha,et al.  AN EFFICIENT, FORWARD FAULT SIMULATION ALGORITHM BASED ON THE PARALLEL PATTERN SINGLE FAULT PROPAGAT , 1991, 1991, Proceedings. International Test Conference.

[2]  P. R. Menon,et al.  Critical Path Tracing: An Alternative to Fault Simulation , 1984, IEEE Des. Test.

[3]  Kewal K. Saluja,et al.  An efficient signature computation method , 1992, IEEE Design & Test of Computers.

[4]  Irith Pomeranz,et al.  On Fault Simulation for Synchronous Sequential Circuits , 1995, IEEE Trans. Computers.

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

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

[7]  Janak H. Patel,et al.  PROOFS: a fast, memory-efficient sequential circuit fault simulator , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

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

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

[11]  Minesh B. Amin,et al.  ZAMBEZI: a parallel pattern parallel fault sequential circuit fault simulator , 1996, Proceedings of 14th VLSI Test Symposium.

[12]  Kurt Antreich,et al.  Accelerated Fault Simulation and Fault Grading in Combinational Circuits , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[13]  Janusz Rajski,et al.  The dynamic reduction of fault simulation , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  Wu-Tung Cheng,et al.  Differential Fault Simulation - A Fast Method Using Minimal Memory , 1989, 26th ACM/IEEE Design Automation Conference.

[15]  Janak H. Patel,et al.  A parallel algorithm for fault simulation based on PROOFS , 1995, Proceedings of ICCD '95 International Conference on Computer Design. VLSI in Computers and Processors.

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

[17]  Chen-Shang Lin,et al.  Fast fault simulation for BIST applications , 1995, Proceedings of the Fourth Asian Test Symposium.

[18]  Slawomir Pilarski,et al.  A probabilistic analysis of test response compaction , 1995 .

[19]  Bill Underwood,et al.  The parallel-test-detect fault simulation algorithm , 1989, Proceedings. 'Meeting the Tests of Time'., International Test Conference.

[20]  Kewal K. Saluja,et al.  Parallel computation of LFSR signatures , 1993, Proceedings of 1993 IEEE 2nd Asian Test Symposium (ATS).

[21]  Jacob A. Abraham,et al.  Fault simulation in a distributed environment , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..