
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Sandeep K. Gupta, Mody Lempel, "ZeroAliasing for Modeled Faults," IEEE Transactions on Computers, vol. 44, no. 11, pp. 12831295, November, 1995.  
BibTex  x  
@article{ 10.1109/12.475124, author = {Sandeep K. Gupta and Mody Lempel}, title = {ZeroAliasing for Modeled Faults}, journal ={IEEE Transactions on Computers}, volume = {44}, number = {11}, issn = {00189340}, year = {1995}, pages = {12831295}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.475124}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  ZeroAliasing for Modeled Faults IS  11 SN  00189340 SP1283 EP1295 EPD  12831295 A1  Sandeep K. Gupta, A1  Mody Lempel, PY  1995 KW  Builtin selftest KW  linear feedback shift registers KW  response compaction KW  signature analysis KW  zeroaliasing. VL  44 JA  IEEE Transactions on Computers ER   
In this paper we deal with the selection of a feedback polynomial for the compacting LFSR, such that an erroneous response resulting from any
Upper bounds are derived for the least degree irreducible and primitive zeroaliasing LFSR polynomials. These bounds show that in all practical test applications such a polynomial will be of degree less than 53. Expected bounds are derived and show that when the number of faults is less than 10
Procedures to find irreducible and primitive zeroaliasing LFSR polynomials of: 1) the smallest degree and 2) a prespecified degree; are presented. A lowcomplexity procedure to find a zeroaliasing LFSR polynomial is also presented. The worst case as well as expected time complexities of all these procedures are derived. Experimental results are presented for practical problem sizes to demonstrate the applicability of the proposed procedures.
[1] A.V. Aho,J.E. Hopcroft, and J.D. Ullman,The Design and Analysis of Computer Algorithms.Reading, Mass.: AddisonWesley, 1974.
[2] R.K. Brayton, G.D. Hachtel, C.T. McMullen, and A.L. SangiovanniVincintelli, Logic Minimization Algorithms for VLSI Synthesis.Boston: Kluwer Academic, 1984.
[3] E.R. Berlekamp,“Factoring polynomials over large finite fields,” Mathematics of Computation, vol. 24, no. 111, pp. 713735, July 1970.
[4] D.G. Cantor and H. Zassenhaus,“A new algorithm for factoring polynomials over finite fields,” Mathematics of Computation, vol. 36, no. 154, pp. 587592, Apr. 1981.
[5] K. Chakrabarty and J.P. Hayes, "AliasingFree Error Detection (ALFRED)," Proc. 1993 VLSI Test Symp., pp. 260267, Apr. 1993.
[6] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGrawHill, 1990.
[7] S. Gupta, D.K. Pradhan, and S.M. Reddy, "Zero Aliasing Compression," Proc. IEEE Int'l Symp. FaultTolerant Computing, pp. 254263, June 1990.
[8] R. L. Graham, D. E. Knuth, and O. Patashnik,Concrete Mathematics. Reading, MA: AddisonWesley, 1989.
[9] D.R. HeathBrown,“Zerofree regions for Dirichlet Lfunctions, and the least prime in anarithmetic progression,” Proc. London Math. Soc., vol. 64, no. 3, pp. 265338, 1992.
[10] A. Lempel,G. Seroussi,, and S. Winograd,“Complexity of multiplication in finite fields,” Theoretical Computer Science, vol. 22, pp. 285296, 1983.
[11] M. Lempel,S.K. Gupta,, and M.A. Breuer,“Test embedding with discrete logarithms,” Proc. 12th IEEE VLSI Test Symp., pp. 7480, 1994.
[12] R. Lidl and H. Niederreiter,An Introduction to Finite Fields and Their Applications.Cambridge: Cambridge Univ. Press, 1986.
[13] I. Pomeranz,S.M. Reddy,, and R. Tangirala,“On achieving zero aliasing for modeled faults,” Proc. European Design Automation Conf., 1992.
[14] D.K. Pradhan and S. Gupta, A New Framework for Designing and Analyzing BIST Techniques and Zero Aliasing Compression IEEE Trans. Computers, vol. 40, no. 6, June 1991.
[15] M.O. Rabin,“Probabilistic algorithms in finite fields,” SIAM J. Computing, vol. 9, no. 2, pp. 273280, May 1980.
[16] P. Ribenboim,The Book of Prime Number Records, 2nd Edition. SpringerVerlag, 1989.
[17] A. Schönhage,“Schnelle Multiplikation von Polynomenüber Körpern der Charakteristik 2,” Acta Informatica, vol. 7, pp. 395398, 1977.