ABSTRACT
Reseeding is used to improve fault coverage of pseudo-random testing. The seed corresponds to the initial state of the PRPG before filling the scan chain. In this paper, we present a technique for encoding a given seed by the number of clock cycles that the PRPG needs to run to reach it. This encoding requires many fewer bits than the bits of the seed itself. The cost is the time to reach the intended seed. We reduce this cost using the degrees of freedom (due to don't cares in test patterns) in solving the equations for the seeds. We show results for implementing our technique completely in on-chip hardware and for applying it from a tester. Simulations show that with low hardware overhead, the technique provides 100% single-stuck fault coverage. Also, when compared with conventional reseeding from an external tester or on-chip ROM, the technique reduces seed storage by up to 85%. We show how to apply the technique for both LFSRs and CA.
- Al-Yamani A., and E. J. McCluskey, "Built-In Reseeding for Serial BIST", VLSI Test Symposium, Apr., 2003. Google ScholarDigital Library
- Al-Yamani A., S. Mitra, and E.J. McCluskey, "BIST Reseeding with Very Few Seeds", VLSI Test Symposium, Apr., 2003. Google ScholarDigital Library
- Bardell, P.H., W. McAnney, and J. Savir, "Built-In Test for VLSI", John Wiley, New York, 1987. Google ScholarDigital Library
- Eichelberger, E. B., and E. Lindbloom, "Random-Pattern Coverage Enhancement and Diagnosis for LSSD Logic Self-Test", IBM Journal of Research and Development, Vol. 27, No. 3, pp. 265--272, May 1983.Google ScholarDigital Library
- Eichelberger, E., E. Lindbloom, F. Motica, and J. Waicukauski, "Weigted Random Pattern Testing Apparatus and Method," US Patent 4,801,870, Jan. 1989.Google Scholar
- Fagot, C., O. Gascuel, P. Girard and C. Landrault, "On Calculating Efficient LFSR Seeds for Built-In Self Test," Proc. of European Test Workshop, pp. 7--14, 1999. Google ScholarDigital Library
- Hellebrand, S., J. Rajski, S. Tarnick, S. Venkataraman and B. 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. Google ScholarDigital Library
- Koenemann, B., "LFSR-Coded Test Patterns for Scan Designs," Proc. of European Test Conference, pp. 237--242, 1991.Google Scholar
- Koenemann, B., "System for Test Data Storage Reduction," US Patent 6,041,429, Mar. 2000.Google Scholar
- Krishna, C. V., A. Jas, and N. Touba, "Test Vector Encoding Using Partial LFSR Reseeding" Proc. of International Test Conference, pp. 885--893, 2001. Google ScholarDigital Library
- Lempel, M., S. Gupta and M. Breuer, "Test Embedding with Discrete Logarithms," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 14, No. 5, pp. 554--566, May 1995. Google ScholarDigital Library
- McCluskey, E.J., "Built-In Self-Test Techniques," IEEE Design & Test, pp. 21--28, Apr. 1985.Google ScholarDigital Library
- Rajski, J., J. Tyszer and N. Zacharia , "Test Data Decompression for Multiple Scan Designs with Boundary Scan," IEEE Transactions on Computers, Vol. 47, No. 11, pp. 1188--1200, Nov. 1998. Google ScholarDigital Library
- Touba, N.A., and E.J. McCluskey, "Test Point Insertion Based on Path Tracing," Proc. of VLSI Test Symposium, pp. 2--8, 1996. Google ScholarDigital Library
- Touba, N. and E.J. McCluskey, "Altering Bit Sequence to Contain Predetermined Patterns," US Patent 6,061,818, May, 2000.Google Scholar
- Wunderlich, H.-J., "Multiple Distributions for Biased Random Test Patterns," IEEE Transactions on CAD, Vol. 9, No. 6, pp.584--593, Jun. 1990.Google ScholarDigital Library
Index Terms
- Seed encoding with LFSRs and cellular automata
Recommendations
On the Generation of Pseudo-Deterministic Two-Patterns Test Sequence with LFSRs
EDTC '97: Proceedings of the 1997 European conference on Design and TestMany Built-in Self Test (BIST) pattern generators use Linear Feedback Shift Registers (LFSR) to generate test sequences. In this paper, we address the generation of deterministic pairs of patterns for delay faults testing with LFSRs. A new synthesis ...
Test Set Compression Through Alternation Between Deterministic and Pseudorandom Test Patterns
This paper presents a new reseeding technique that reduces the storage required for the seeds as well as the test application time by alternating between ATPG and reseeding to optimize the seed selection. The technique avoids loading a new seed into the ...
Implicit test pattern generation constrained to cellular automata embedding
VTS '97: Proceedings of the 15th IEEE VLSI Test SymposiumThis paper presents an implicit methodology that constrains a test pattern generator to identify test sequences which can be reproduced by cellular automata (CA). The so identified CA can be synthesized as an autonomous finite state machine and can be ...
Comments