
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
P. Caspi, J. Piotrowski, R. Velazco, "An a Priori Approach to the Evaluation of Signature Analysis Efficiency," IEEE Transactions on Computers, vol. 40, no. 9, pp. 10681071, September, 1991.  
BibTex  x  
@article{ 10.1109/12.83653, author = {P. Caspi and J. Piotrowski and R. Velazco}, title = {An a Priori Approach to the Evaluation of Signature Analysis Efficiency}, journal ={IEEE Transactions on Computers}, volume = {40}, number = {9}, issn = {00189340}, year = {1991}, pages = {10681071}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.83653}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  An a Priori Approach to the Evaluation of Signature Analysis Efficiency IS  9 SN  00189340 SP1068 EP1071 EPD  10681071 A1  P. Caspi, A1  J. Piotrowski, A1  R. Velazco, PY  1991 KW  signature analysis; a priori randomization; LFSRs; linear feedback shift registers; irreducible polynomials; logic testing. VL  40 JA  IEEE Transactions on Computers ER   
The authors present an evaluation of signature analysis efficiency which does not rely on assumptions about the distribution of the analyzed error sequences. This is achieved through the use of an 'a priori randomization' technique, which leads to a choice of LFSRs (linear feedback shift registers) corresponding to randomly chosen irreducible polynomials of a given degree. As it does not make use of assumptions on the error distribution, the proposed evaluation is more pessimistic than the usual ones. In particular, it takes into account the length of the analyzed sequence. However, it can be valuable when the efficiency of signature analysis has to be guaranteed, for highly dependable applications for instance.
[1] J. E. Smith, "Measures of the effectiveness of fault signature analysis,"IEEE Trans. Comput., pp. 510514, June 1980.
[2] R. A. Frohwerk, "Signature analysis: A new digital field service method,"Hewlett Packard J., pp. 28, May 1977.
[3] W. C. Carter, "The ubiquitous parity bit," inProc. 12th Int. Symp. Fault Tolerant Comput., June 1982, pp. 289296.
[4] R. David, "Feedback shift register testing," inProc. 8th Int. Symp. Fault Tolerant Comput., June 1982, pp. 103107.
[5] T. W. Williamset al., "Bounds of aliasing errors in linear feedback shift registers," inProc. Comp. Euro. '87, VLSI Comput., Hamburg, May 1987, pp. 373377.
[6] T. W. Williams,et al. "Comparison of aliasing errors for primitive and non primitive polynomials," in Proc. Int. Test Conference, 282288, September 1986.
[7] T. W. Williams, W. Daehn, M. Gruetzner, and C. W. Starke, "Bounds and analysis of aliasing errors in linearfeedback shiftregisters,"IEEE Trans. ComputAided Design, vol. CAD7, pp. 7583, Jan. 1988.
[8] S. K. Gupta and D. K. Pradhan, "A new framework for designing analyzing BIST techniques: Computation of aliasing probability," inProc. ITC, 1988.
[9] I. Ivanov and V. K. Agrawal, "An iterative technique for calculating aliasing probability of linear feedback shift registers," inProc. 18th Int. Symp. Fault Tolerant Comput., Tokyo, Japan, 1988.
[10] R. David, "Signature analysis of multioutput circuits," inProc. 14th Int. Symp. Fault Tolerant Comput., June 1984, pp. 366371.
[11] K. Iwasaki, "Analysis and proposal of signature circuits for LSI testing, "IEEE Trans. Comput.Aided Design, vol. 7, no. 1, pp. 8490, Jan 1988.
[12] J. J. Shedletsky and E. J. McCluskey, "The error latency of a fault in a sequential digital circuit,"IEEE Trans. Comput., pp. 655658, June 1976.
[13] F. J. MacWilliams and N. J. A. Sloane,The Theory of ErrorCorrecting Codes. Amsterdam, The Netherlands: North Holland.