During built-in self-test (BIST), the set of patterns generated by a pseudo-random pattern generator may not provide sufficiently high fault coverage and many patterns can’t detect fault (called useless patterns). In order to reduce the test time, we can remove useless patterns or change them to useful patterns (fault dropping). In fact, a random test set includes many useless patterns. Therefore we present a technology, including both reseeding and bit modifying (a.k.a. pattern mapping) to remove useless patterns or change them to useful patterns. When patterns changed, we pick out number of different fewer bits, leading to very short test length. Then we use an additional bit counter to improve test length and achieve high fault coverage. The technique we present is applicable for single-stuck-at faults. Experimental results indicate that complete fault coverage-100% can be obtained with less test time.
[1] Eichelberger, E. B. and Lindbloom, E., “Random-Pattern Coverage Enhancement and Diagnosis for LSSD Logic Self-Test,” IBM Journal of Research and Development, Vol. 27, pp. 265272 (1983).
[2] Touba, N. A. and McCluskey, E. J., “Test Point Insertion Based on Path Tracing,” Proc. of VLSI Test Symposium, pp. 28 (1996).
[3] Chiang, C. H. and Gupta, S. K., “Random Pattern Testable Logic Synthesis,” Proc. of International Conference on Computer-Aided Design (ICCAD), pp. 125 128 (1994).
[4] Touba, N. A. and McCluskey, E. J., “Automated Logic Synthesis of Random Pattern Testable Circuits,” Proc. of International Test Conference, pp. 174183 (1994).
[5] Eichelberger, E. B., Lindbloom, E., Motica, F. and Waicukauski, J., “Weighted Random Pattern Testing Apparatus and Method,” US Patent 4,801,870, Jan. 89.
[6] Hellebrand, S., Reeb, B., Tarnick, S. and Wunderlich, H.-J., “Pattern Generation for a Deterministic BIST Scheme,” Proc. of International Conference on Computer-Aided Design (ICCAD), pp. 8894 (1995).
[7] Touba, N. A. and McCluskey, E. J., “Altering Bit Sequence to Contain Predetermined Patterns,” US Patent 6,061,818, May (2000).
[8] Rajski, J., Tyszer, J. and Zacharia, N., “Test Data Decompression for Multiple Scan Designs with Boundary Scan,” IEEE Transactions on Computers, Vol. 47, pp. 11881200 (1998).
[9] Touba, N. A. and McCluskey, E. J., “Synthesis of Mapping Logic for Generating Transformed PseudoRandom Patterns for BIST,” Proc. of International Test Conference, pp. 674682 (1995).
[10] Al-Yamani, A. A. and McCluskey, E. J., “Built-In Reseeding for Serial BIST,” Proc. VLSI Test Symposium, pp. 63683 (2003).
[11] Al-Yamani, A. A., Mitra, S. and McCluskey, E. J., “BIST Reseeding with Very Few Seeds,” Proc. VLSI Test Symposium, pp. 6974 (2003).
[12] Fagot, C., Gascuel, O., Girard, P. and Landrault, C., “On Calculating Efficient LFSR Seeds for Built-In Self Test,” Proc. of European Test Workshop, pp. 714 (1999).
We use cookies on this website to personalize content to improve your user experience and analyze our traffic. By using this site you agree to its use of cookies.
