
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
D.K. Pradhan, S.K. Gupta, "A New Framework for Designing and Analyzing BIST Techniques and Zero Aliasing Compression," IEEE Transactions on Computers, vol. 40, no. 6, pp. 743763, June, 1991.  
BibTex  x  
@article{ 10.1109/12.90252, author = {D.K. Pradhan and S.K. Gupta}, title = {A New Framework for Designing and Analyzing BIST Techniques and Zero Aliasing Compression}, journal ={IEEE Transactions on Computers}, volume = {40}, number = {6}, issn = {00189340}, year = {1991}, pages = {743763}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.90252}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A New Framework for Designing and Analyzing BIST Techniques and Zero Aliasing Compression IS  6 SN  00189340 SP743 EP763 EPD  743763 A1  D.K. Pradhan, A1  S.K. Gupta, PY  1991 KW  framework; BIST techniques; zero aliasing compression; shift registerbased signature analysis; mathematical model; coding theory; LFSR; MISR; hardware complexity; error models; circuit topology; exact closedform expressions; builtin self test; logic testing. VL  40 JA  IEEE Transactions on Computers ER   
A general framework for shift registerbased signature analysis is presented, and a mathematical model for this frameworkbased on coding theoryis developed. There are two key features of this formulation, first, it allows for uniform treatment of LFSR, MISR, and multiple MISRbased signature analyzer. In addition, using this formulation, a new compression scheme for multiple output CUT is proposed. This scheme, referred to as multiinput LFSR, has the potential to achieve better aliasing than other schemes such as the multiple MISR scheme of comparable hardware complexity. Several results on aliasing are presented, and certain known results are shown to be direct consequences of the formulation. Also developed are error models that take into account the circuit topology and the effect of faults at the outputs. Using these models, exact closedform expressions for aliasing probability are developed. A closedform aliasing expression for MISR under an independent error model is provided.
[1] S. B. Akers, "A parity bit signature for exhaustive testing,"IEEE Trans. Comput.Aided Design, vol. 7, no. 3, pp. 333338, Mar. 1988.
[2] E. D. Baran, "Reliability of testing of binary sequences by counting,"Automat. Contr. Comput. Sci., no. 6, pp. 6670, 1982.
[3] P. H. Bardell, W. H. McAnney, and J. Savir,BuiltIn Test for VLSI: Pseudorandom Techniques. New York: Wiley, 1987.
[4] D. K. Bhavsar and B. Krishnamurthy, "Can we eliminate fault escape in self testing by polynomial division (signature analysis)?," inProc. ITC, 1984, pp. 134139.
[5] B. Bose, "Group theoretic signature analysis,"IEEE Trans. Comput., vol. 39, no. 9, pp. 13981403, Nov. 1990.
[6] F. Brglez and H. Fujiwara, "A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN," available in principle upon receipt of a magnetic tape from the authors.
[7] A. J. Briers and K. A. E. Totton, "Random pattern testability by fast fault simulation," inProc. ITC, 1986, pp. 274281.
[8] R. A. Frohwerk, "Signature analysis: A new digital field service method,"HewlettPackard J., May 1977.
[9] T. Fujiwara, T. Kasami, A. Kitai, and S. Lin, "On the undetected error probability for shortened Hamming codes,"IEEE Trans. Commun., vol. COM33, no. 6, pp. 570574, June 1985.
[10] S. W. Golomb,Shift Register Sequences, rev. ed. Laguna Hills, CA: Aegean Park Press, 1982.
[11] S. K. Gupta and D. K. Pradhan, "Combining data compression techniques," inProc. BIST Workshop, Charleston, SC, 1987.
[12] S. K. Gupta and D. K. Pradhan, "A new framework for designing analyzing BIST techniques: Computation of aliasing probability," inProc. ITC, 1988.
[13] S. K. Gupta, D. K. Pradhan, and S. M. Reddy, "Zero aliasing compression," inProc. FTCS20, 1990.
[14] 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.
[15] K. Iwasaki, "Analysis and proposal of signature circuits for LSI testing, "IEEE Trans. Comput.Aided Design, vol. 7, no. 1, pp. 8490, Jan 1988.
[16] K. Iwasaki and F. Arakawa, "An analysis of the aliasing probability of multiple input signature registers in the case of a 2mary symmetric channel,"IEEE Trans. Comput.Aided Design, vol. 9, no. 4, pp. 427438, Apr. 1990.
[17] S. K. Jain and V. D. Agrawal, "Statistical fault analysis,"IEEE Design Test Comput., pp. 3844, Feb. 1985.
[18] J. Justesen, "A class of constructive asymptotically good algebraic codes,"IEEE Trans. Inform. Theory, vol. IT18, no. 5, pp. 652656, Sept. 1972.
[19] T. Kasami and S. Lin, "The binary weight distribution of the extended (2m, 2m 4) code of the ReedSolomon code over GF(2m) with generator polynomial (xa)(xa2)(xa3),"Linear Algebra Appl., vol. 98, pp. 291307, 1988.
[20] B. Krishnamurthy and I. G. Tollis, "Improved techniques for estimating signal probabilities," inProc. ITC, 1986, pp. 244251.
[21] S. Lin and D. J. Costello,Error Control Coding: Fundamentals and Applications. Englewood Cliffs, NJ: PrenticeHall, 1983.
[22] F. J. MacWilliams and N. J. A. Sloane,Theory of ErrorCorrecting Codes. Amsterdam, The Netherlands, NorthHolland, 1978.
[23] G. Markowsy, "Bounding signal probabilities in combinational circuits,"IEEE Trans. Comput., vol. C36, no. 10, Oct. 1987.
[24] W. W. Peterson and E. J. Weldon,ErrorCorrecting Codes, second ed. Cambridge, MA: MIT Press, 1972.
[25] D. K. Pradhan, S. K. Gupta, and M. G. Karpovsky, "Aliasing probability for multiple input signature analyzer and a new compression technique,"IEEE Trans. Comput., vol. 39, no. 4, pp. 586591, Apr. 1990.
[26] D. K. Pradhan, M. Y. Hsiao, A. M. Patel, and S. Y. Su, "Shift register designed for online fault detection," inProc. FTCS, 1978, pp. 173178.
[27] J. P. Robinson and N. R. Saxena, "A unified view of test compression methods,"IEEE Trans. Comput., vol. C36, no. 1, pp. 9499, Jan. 1987.
[28] J. P. Robinson and N. R. Saxena, "Simultaneous signature and syndrome compression,"IEEE Trans. Comput.Aided Design, vol. 7, no. 5, pp. 584589, May 1988.
[29] J. Savir, G. S. Ditlow, and P. H. Bardell, "Random pattern testability,"IEEE Trans. Comput., vol. C33, no. 1, pp. 7990, Jan. 1984.
[30] N. R. Saxena and J. P. Robinson, "Accumulator compression testing,"IEEE Trans. Comput., vol. C35, no. 4, pp. 317321, Apr. 1986.
[31] S. C. Seth, L. Pan, and V. D. Agrawal, "PREDICTProbabilistic estimation of digital circuit testability," inProc. FTCS15, 1985, pp. 220225.
[32] N. J. A. Sloane and E. R. Berlekamp, "Weight enumerator of secondorder ReedMuller codes,"IEEE Trans. Inform. Theory, vol. IT16, no. 6, pp. 745751, Nov. 1970.
[33] J. E. Smith, "Measures of the effectiveness of fault signature analysis,"IEEE Trans. Comput., vol. C29, no. 6, pp. 510514, June 1980.
[34] L. Ward and E. J. McCluskey, "Condensed linear feedback shift register (LFSR) testingA pseudo exhaustive test technique,"IEEE Trans. Comput., vol. C35, no. 4, pp. 367370, Apr. 1986.
[35] T. W. Williams, A. Daehn, M. Gruetzner, and C. W. Starke, "Aliasing errors in signature analysis registers,"IEEE Design Test Comput., vol. C36, no. 4, pp. 3945, Apr. 1987.
[36] J. K. Wolf, A. M. Michelson, and A. H. Levesque, "On the probability of undetected error for linear block codes,"IEEE Trans. Commun., vol. COM30, no. 2, pp. 317324, Feb. 1982.
[37] Y. Zorian and V. K. Agrawal, "A general scheme to optimize error masking in builtin selftesting," inProc. FTCS16, 1986, pp. 410415.
[38] M. G. Karpovsky, S. K. Gupta, and D. K. Pradhan, "A uniform analysis of aliasing in MISR compression for error models," inProc. ITC, 1991.
[39] M. Damianiet al., "Aliasing in signature analysis testing with multiple input shift registers,"IEEE Trans. Comput.Aided Design, vol. CAD9, no. 12, pp. 13441353, Dec. 1990.