
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
N.R. Saxena, P. Franco, E.J. McCluskey, "Simple Bounds on Serial Signature Analysis Aliasing for Random Testing," IEEE Transactions on Computers, vol. 41, no. 5, pp. 638645, May, 1992.  
BibTex  x  
@article{ 10.1109/12.142690, author = {N.R. Saxena and P. Franco and E.J. McCluskey}, title = {Simple Bounds on Serial Signature Analysis Aliasing for Random Testing}, journal ={IEEE Transactions on Computers}, volume = {41}, number = {5}, issn = {00189340}, year = {1992}, pages = {638645}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.142690}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Simple Bounds on Serial Signature Analysis Aliasing for Random Testing IS  5 SN  00189340 SP638 EP645 EPD  638645 A1  N.R. Saxena, A1  P. Franco, A1  E.J. McCluskey, PY  1992 KW  serial signature analysis aliasing; random testing; aliasing probability; signature polynomial; simple bounds; linear finite state machine; linear cellular automaton; intermediate signatures; computational complexity; finite automata; integrated circuit testing; logic testing; probability. VL  41 JA  IEEE Transactions on Computers ER   
It is shown that the aliasing probability is bounded above by (1+ epsilon )/L approximately=1/L ( epsilon small for large L) for test lengths L less than the period, L/sub c/, of the signature polynomial; for test lengths L that are multiples of L/sub c/, the aliasing probability is bounded above by 1; for test lengths L greater than L/sub c/ and not a multiple of L/sub c/, the aliasing probability is bounded above by 2/(L/sub c/+1). These simple bounds avoid any exponential complexity associated with the exact computation of the aliasing probability. Simple bounds also apply to signature analysis based on any linear finite state machine (including linear cellular automaton). From these simple bounds it follows that the aliasing probability in a signature analysis design using beta intermediate signatures is bounded by ((1+ epsilon )/sup beta / beta /sup beta /)/L/sup beta /, for beta >L and L/ beta >L/sub c/. By using intermediate signatures the aliasing probability can be substantially reduced.
[1] E. R. Berlekamp,Algebraic Coding Theory, revised ed. Laguna Hills, CA: Aegean Park Press, 1984.
[2] M. Damiani, P. Olivo, M. Favalli, and B. Riccò, "An analytical model for aliasing probability in signature analysis testing,"IEEE Trans. Comput.Aided Design, vol. CAD8, pp. 11331144, Nov. 1989.
[3] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NPCompleteness. San Francisco, CA: Freeman, 1979.
[4] P. Gelsingeret al., "Computer aided design and builtin selftest on the i486TM CPU," inProc. ICCD, Oct. 1989, pp. 199201.
[5] A. Ivanov and V. K. Agarwal, "An analysis of the probabilistic behavior of linear feedback signature registers,"IEEE Trans. Comput.Aided Design, vol. 8, pp. 10741088, Oct. 1989.
[6] K. Iwasaki and N. Yamaguchi, "Design of signature circuits based on weight distribution of errorcorrecting codes," inProc. ITC, Sept. 1990, pp. 779785.
[7] E. J. McCluskeyet al., "Probability models for pseudorandom test sequences, "IEEE Trans. Comput.Aided Design, vol. 7, pp. 6874, Jan. 1988.
[8] I. M. Ratiu and H. B. Bokoglu, "Pseudorandom builtin selftest methodology and implementation for the IBM RISC System/6000 processor,"IBM J. Res. Develop., vol. 34, no. 1, pp. 7884, Jan. 1990.
[9] N. R. Saxena, "Test compression methods," M.S. thesis, Univ. Iowa, May 1984.
[10] N. R. Saxena, E. J. McCluskey, and P. Franco, "Bounds on signature analysis aliasing for random testing," Stanford CRC Tech. Rep., CRC TR #9011, Dec. 1990.
[11] N. R. Saxena, P. France, and E. J. McCluskey, "Refined bounds on signature analysis aliasing for random testing," inITC91 Proc., Oct. 1991, pp. 818827.
[12] M. Serraet al., "The analysis of onedimensional linear cellular automata and their aliasing properties,"IEEE Trans. Comput.Aided Design, vol. 9, pp. 767778, July 1990.
[13] J. J. Shedletsky, "Random testing: Practicality vs. verified effectiveness," inProc. Seventeenth Annu. Int. Conf. FaultTolerant Comput., June 1977, pp. 175179.
[14] T. W. Williamset al., "Aliasing errors in signature analysis,"IEEE Design Test Comput., pp. 3945, Apr. 1987.
[15] N. Benowitz, D. F. Calhoun, G. E. Alderson, J. E. Bauer, and C.T. Joeckel, "An advanced fault isolation system for digital logic,"IEEE Trans. Comput., vol. C24, pp. 489497, May 1975.
[16] R. A. Frohwerk, "Signature analysis: A new digital field service method,"HewlettPackard J., pp. 28, May 1977.
[17] D. K. Pradhan and S. K. Gupta, "A new framework for designing and analyzing BIST techniques and zero aliasing compression,"IEEE Trans. Comput., C40, pp. 743763, June 1991.
[18] I. Pomeranz, S. M. Reddy, and R. Tangirala, "On achieving zero aliasing for modeled faults," inProc. EDAC, to be published.