This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Built-In Test for Circuits with Scan Based on Reseeding of Multiple-Polynomial Linear Feedback Shift Registers
February 1995 (vol. 44 no. 2)
pp. 223-233

Abstract—In this paper, we propose a new scheme for Built-In Test (BIT) that uses Multiple-polynomial Linear Feedback Shift Registers (MP-LFSR's). The same MP-LFSR that generates random patterns to cover easy to test faults is loaded with seeds to generate deterministic vectors for difficult to test faults. The seeds are obtained by solving systems of linear equations involving the seed variables for the positions where the test cubes have specified values. We demonstrate that MP-LFSR's produce sequences with significantly reduced probability of linear dependence compared to single polynomial LFSR's. We present a general method to determine the probability of encoding as a function of the number of specified bits in the test cube, the length of the LFSR and the number of polynomials. Theoretical analysis and experiments show that the probability of encoding a test cube with s specified bits in an s-stage LFSR with 16 polynomials is 1–10^{-6}. We then present the new BIT scheme that allows for an efficient encoding of the entire test set. Here the seeds are grouped according to the polynomial they use and an implicit polynomial identification reduces the number of extra bits per seed to one bit. The paper also shows methods of processing the entire test set consisting of test cubes with varied number of specified bits. Experimental results show the tradeoffs between test data storage and test application time while maintaining complete fault coverage.

Index Terms—Built-In Test, hardware test pattern generators, input test data compression and decompression, multiple-polynomial LFSR, reseeding, scan design.

[1] Z. Barzilai, D. Coppersmith, and A. L. Rosenberg,“Exhaustive generation of bit patterns with applications to VLSI self-testing,”IEEE Trans. Comput., vol. C-32, no. 2, pp. 190–194, Feb. 1983.
[2] L. T. Wang and E. J. McCluskey,“Circuits for pseudo-exhaustive test pattern generation,”inProc. IEEE Int. Test Conf., 1986, pp. 25–37.
[3] H.-J. Wunderlich and S. Hellebrand,“The pseudo-exhaustive test of sequential circuits,”IEEE Trans. Computer-Aided Design Integrated Circuits Syst., vol. 11, no. 1, pp. 26–33, Jan. 1992.
[4] P.H. Bardell, W.H. McAnney, and J. Savir, Built-In Test for VLSI, John Wiley&Sons, New York, 1987.
[5] F. Brglezet al.,“Hardware-based weighted random pattern generation for boundary-scan,”inProc. IEEE Int. Test Conf., Washington, DC, 1989, pp. 264–274.
[6] H.-J. Wunderlich,“Self test using unequiprobable random patterns,”inProc. 17th Int. Symp. Fault-Tolerant Comput., Pittsburgh, PA, 1987, pp. 258–263.
[7] ——,“Multiple distributions for biased random test patterns,”inProc. IEEE Int. Test Conf., Washington, DC, 1988, pp. 236–244.
[8] R. Dandapani, J. H. Patel, and J. A. Abraham,“Design of test pattern generators for built-in test,”inProc. IEEE Int. Test Conf., Washington, DC, 1984, pp. 315–319.
[9] W. Daehn and J. Mucha,“Hardware test pattern generators for built-in test,”inProc. IEEE Int. Test Conf., 1981, pp. 110–113.
[10] S. B. Akers and W. Jansz,“Test set embedding in built-in self-test environment,”inProc. IEEE Int. Test Conf., Washington, DC, 1989, pp. 257–263.
[11] C. Dufaza and G. Gambon,“LFSR-based deterministic and pseudo-random test patterns generator structures,”inProc. Europ. Test Conf., Munich, Germany, 1991, pp. 27–34.
[12] B. Koenemann,“LFSR-coded test patterns for scan designs,”inProc. Europ. Test Conf., Munich, Germany, 1991, pp. 237–242.
[13] S. Hellebrand, S. Tarnick, J. Rajski, and B. Courtois,“Generation of vector patterns through reseeding of multiple-polynomial linear feedback shift registers,”inProc. IEEE Int. Test Conf., Baltimore, MD, 1992, pp. 120–129.
[14] S. Venkataraman, J. Rajski, S. Hellebrand, and S. Tarnick,“An efficient BIST scheme based on reseeding of multiple polynomial linear feedback shift registers,”inProc. IEEE/ACM Int. Conf. Computer-Aided Design, Santa Clara, CA, 1993, pp. 572–577.
[15] C.L. Chen, "Linear Dependencies in Linear Feedback Shift Registers," IEEE Trans. Computers, vol. 32, no. 12, Dec. 1986, pp. 1086-1088.
[16] P.H. Bardell, "Design Considerations for Parallel Pseudorandom Pattern Generators," J. Electronic Testing, no. 1, pp. 73-87, 1990.
[17] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[18] S. Venkataraman,“Built-in self test based on reseeding of linear feedback shift registers,”Masters Thesis, Dept. of Electrical Engineering, McGill University, Montreal, July 1993.
[19] F. Brglez, D. Bryan, and K. Kozminski,“Combinational profiles of sequential benchmark circuits,”inProc. IEEE Int. Symp. Circuits Syst., 1989, pp. 1929–1934.
[20] M. Schulz and E. Auth,“Advanced automatic test generation and redundancy identification techniques,”inProc. 18th Int. Symp. Fault-Tolerant Comput., Tokyo, Japan, 1988, pp. 30–35.
[21] A. Ralston and P. Rabinowitz,A First Course in Numerical Analysis, 2nd ed. New York: McGraw-Hill, 1978.
[22] I. Pomeranz, L.N. Reddy, and S.M. Reddy, "COMPACTEST: A Method to Generate Compact Test Sets for Combinational Circuits," Proc. 1991 Int'l Test Conf., pp. 194-203, Oct. 1991.

Citation:
Sybille Hellebrand, Janusz Rajski, Steffen Tarnick, Srikanth Venkataraman, Bernard Courtois, "Built-In Test for Circuits with Scan Based on Reseeding of Multiple-Polynomial Linear Feedback Shift Registers," IEEE Transactions on Computers, vol. 44, no. 2, pp. 223-233, Feb. 1995, doi:10.1109/12.364534
Usage of this product signifies your acceptance of the Terms of Use.