
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
André Ivanov, Barry K. Tsuji, Yervant Zorian, "Programmable BIST Space Compactors," IEEE Transactions on Computers, vol. 45, no. 12, pp. 13931404, December, 1996.  
BibTex  x  
@article{ 10.1109/12.545969, author = {André Ivanov and Barry K. Tsuji and Yervant Zorian}, title = {Programmable BIST Space Compactors}, journal ={IEEE Transactions on Computers}, volume = {45}, number = {12}, issn = {00189340}, year = {1996}, pages = {13931404}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.545969}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Programmable BIST Space Compactors IS  12 SN  00189340 SP1393 EP1404 EPD  13931404 A1  André Ivanov, A1  Barry K. Tsuji, A1  Yervant Zorian, PY  1996 KW  Testing KW  BuiltIn SelfTest (BIST) KW  design for testability KW  BIST methodologies KW  BIST space compaction KW  genetic algorithms KW  parity tree KW  BIST compaction. VL  45 JA  IEEE Transactions on Computers ER   
Abstract—We address test data compaction for builtin selftest (BIST). We propose a novel taxonomy useful for classifying and comparing BIST compactors. The taxonomy uses the following attributes: space, time, memory, linearity, and circuit (functional) specificity. The thrust of the work focuses on BIST
[1] M. Abadir, "Efficient Scan Path Testing Using Sliding Parity Response Compaction (SPRC)," Proc. ICCAD, 1987.
[2] V.K. Agarwal, "Increased Effectiveness of BuiltIn Testing by Output Data Modification," Proc. 13th Int'l Symp. FaultTolerant Computing Systems, pp. 227234, June 1983.
[3] S.B. Akers, "A Parity Bit Signature for Exhaustive Testing," IEEE Trans. ComputerAided Design, vol. 7, no. 3, pp. 333338, 1988.
[4] P.H. Bardell, W.H. McAnney, and J. Savir, BuiltIn Test for VLSI, John Wiley&Sons, New York, 1987.
[5] W.C. Carter, "The Ubiquitous Parity Bit," Proc. 12th Int'l Symp. FaultTolerant Computing, pp. 289296, June 1982.
[6] K. Chakrabarty and J.P. Hayes, "AliasingFree Error Detection (ALFRED)," Proc. 1993 VLSI Test Symp., pp. 260267, Apr. 1993.
[7] R. David, "Signature Analysis for MultipleOutput Circuits," IEEE Trans. Computers, vol. 35, no. 9, pp. 830837, Sept. 1986.
[8] R.A. Frohwerk, "Signature Analysis: A New Digital Field Service Method," HewlettPackard J., pp. 28, May 1977.
[9] H. Fujiwara and K. Kinoshita, "Testing Logic Circuits with Compressed Data," Proc. Eighth Int'l Symp. Fault Tolerant Computing Systems, pp. 108113, June 1978.
[10] S.W. Golomb, Shift Register Sequences. Aegean Park Press, 1982.
[11] S. Gupta, D.K. Pradhan, and S.M. Reddy, "Zero Aliasing Compression," Proc. IEEE Int'l Symp. FaultTolerant Computing, pp. 254263, June 1990.
[12] S.Z. Hassan, D.J. Lu, and E.J. McCluskey, "Parallel Signature Analyzers—Detection Capability and Extensions," Proc. Compcon Spring, pp. 440445, 1983.
[13] J.P. Hayes, "Check Sum Methods for Test Data Compression," J. Design Automation and FaultTolerant Computing, pp. 317, June 1976.
[14] A. Ivanov and S. Pilarski,“Performance of signature analysis: A survey of bounds, exact, and heuristic algorithms,” Integration, the VLSI J., vol. 13, pp.17–38, 1992.
[15] A. Ivanov and Y. Zorian,“Computing the error escape probability in countbased compaction schemes,” Proc. Int’l Conf. ComputerAided Design, pp. 368371, Nov. 1990.
[16] S.K. Jain and C.E. Stroud, "BuiltIn SelfTesting of Embedded Memory," IEEE Design and Test of Computers, pp. 2737, Oct. 1986.
[17] B.W. Johnson, Design and Analysis of FaultTolerant Digital Systems, pp. 394402. Reading, Mass.: AddisonWesley, June 1989.
[18] M. Karpovsky and P. Nagvajara, "Optimal Time and Space Compression of Test Responses For VLSI Devices," Proc. IEEE Int'l Test Conf., pp. 523529, Oct. 1987.
[19] R.K. Latypov, "BuiltIn SelfTesting of Logic Circuits Using Imperfect Duplication," Lecture Notes in Computer Science, vol. 289, pp. 279283, June 1987.Germany: SpringerVerlag.
[20] Y.K. Li and J.P. Robinson, "Space Compression Methods With Output Data Modification," IEEE Trans. ComputerAided Design, vol. 6, no. 2, pp. 290294, Mar. 1987.
[21] C.J. Lin, Y. Zorian, and S. Bhawmik, PSBIST: A Partial Scan Based BuiltIn Self Test Scheme Proc. IEEE Int'l Test Conf., pp. 507516, 1993.
[22] E.J. McCluskey, "BuiltIn SelfTest Techniques" and "BuiltIn SelfTest Structures," IEEE Design and Test of Computers, pp. 2136, Apr. 1985.
[23] B. NadeauDostie, A. Silburt, and V.K. Agarwal, "Serial Interface for EmbeddedMemory Testing," IEEE Design&Test of Computers, Vol. 7, No. 2, Apr. 1990, pp. 5263.
[24] M. Nicolaidis, "An Efficient BIST Scheme for Functional Testof Embedded RAMs," Proc. IEEE Int'l Symp. FaultTolerant Computing, pp. 118123, 1985.
[25] K.P. Parker and E.J. McCluskey, "Probabilistic Treatment of General Combinational Networks," IEEE Trans. Computers, pp. 668670, June 1975.
[26] J. Rajski and J. Tyszer, "Experimental Analysis of Faulty Coverage in Systems with Signature Registers," Proc. European Test Conf., pp. 4551, Apr. 1991.
[27] S.M. Reddy, K.K. Saluja, and M.G. Karpovsky, "A Data Compression Technique for BuiltIn SelfTest," IEEE Trans. Computers, vol. 37, no. 9, pp. 1,1511,156, Sept. 1988.
[28] J.P. Robinson and R. Saxena, "A Unified View of Test Compression Methods," IEEE Trans. Computers, vol. 36, no. 1, pp. 9499, Jan. 1987.
[29] K.K. Saluja and M. Karpovsky, "Test Compression Hardware through Data Compression in Space and Time," Proc. IEEE Int'l Test Conf., pp. 8388, 1983.
[30] J. Savir, "On Shrinking Wide Compressors," Proc. 13th IEEE VLSI Test Symp., pp. 108117,Princeton, N.J., Apr. 1995.
[31] N.R. Saxena and J.P. Robinson, "Accumulator Compression Testing," IEEE Trans. Computers, vol. 35, no. 4, pp. 317321, Apr. 1986.
[32] A.K. Susskind, "Testing by Verifying Walsh Coefficients," Proc. Int'l Symp. FaultTolerant Computing, pp. 206208, June 1981.
[33] B.K. Tsuji, "On Selecting Programmable Space Compactors for BuiltIn SelfTest Using Genetic Algorithms," MASc thesis, Univ. of British Columbia, Vancouver, 1993.
[34] T.W. Williams,W. Daech,M. Gruetzer,, and C.W. Starke,“Bounds and analysis of aliasing errors in linearfeedback shiftregisters,” IEEE Trans. Computer Aided Design, vol. 7, pp. 7583, Jan. 1988.
[35] T.W. Williams et al., "Aliasing Errors in Multiple Input Signature Analysis Registers," Proc. European Test Conf., pp. 338345, Apr. 1989.
[36] Y. Zorian, "Automated BuiltIn SelfTest for Embedded Macrocells," Proc. ATE&Instrumentation Conf. West, Jan. 1992.
[37] Y. Zorian and V.K. Agarwal, "A General Scheme to Optimize Error Masking in BIST," Proc. Int'l Symp. FaultTolerant Computing (FTCS16), pp. 410415, July 1986.
[38] Y. Zorian and V.K. Agarwal, Optimizing Error Masking in BIST by Output Data Modification J. Electronic Testing: Theory and Applications, vol. 1, pp. 5971, 1990.
[39] Y. Zorian and A. Ivanov, "An Effective BIST Scheme for ROMs," IEEE Trans. Computers, Vol. 41, No. 5, May 1992, pp. 646653.
[40] R. Axelrod, "Genetic Algorithm for the Prisoner Dilemma Problem," Genetic Algorithms and Simulated Annealing, L Davis, ed., pp. 3241.London: Pitman, 1987.
[41] N. Benowitz, D.F. Calhoun, G.E. Anderson, J.E. Bauer, and C.T. Joeckel, "An Advanced Fault Isolation System For Digital Logic," IEEE Trans. Computers, vol. 24, no. 5, pp. 489497, May 1975.
[42] L. Booker, "Improving Search in Genetic Algorithms," Genetic Algorithms and Simulated Annealing, L. Davis, ed., pp. 6173.London: Pitman, 1987.
[43] L. Davis and M. Steenstrup, "Genetic Algorithms and Simulated Annealing: An Overview," Genetic Algorithms and Simulated Annealing, L. Davis, ed., pp. 111.London: Pitman, 1987.
[44] S. Forrest, "Implementing Semantic Networks Structures Using the Classifier System," Proc. First Int'l Conf. Genetic Algorithms, pp. 2444, 1985.
[45] S. Geman and D. Geman, "Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, pp. 721741, 1984.
[46] A.M. Gillies, “Machine‐Learning Procedures for Generating Image Domain Feature Detectors,” doctoral dissertation, University of Michigan, Ann Arbor, Mich., 1985.
[47] D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, Mass.: AddisonWesley, 1989.
[48] J.J. Grefenstette, R. Gopal, B. Rosmaita, and D. Van Gucht, "Genetic Algorithms for the Travelling Salesman Problem," Proc. First Int'l Conf. Genetic Algorithms, pp. 160168, 1985.
[49] J.J. Grefenstette, "Incorporating Problem Specific Knowledge into Genetic Algorithms," Genetic Algorithms and Simulated Annealing, L. Davis, ed., pp. 4260.London: Pitman, 1987.
[50] J.H. Holland, Adaptation in Natural and Artificial Systems. Univ. of Michigan Press, 1975.
[51] S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchi, "Optimization by Simulated Annealing," Science, vol. 220, no. 4,598, May13, 1983.
[52] Z. Miachalewicz, Genetic Algorithm + Data Structure = Evolution Programming, SpringerVerlag, New York, 1992.
[53] N. Rao and S. Toida, "Computational Complexity of Test Point Insertion and Decomposition," Proc. Int'l Conf. VLSI, pp. 223, 1991.
[54] E. Wu and P.W. Autkowski, "PEST—A Tool for Implementing PseudoExhaustive Self Test," Proc. IEEE Custom IC Conf., pp. 28.4.128.4.3, 1990.
[55] E. Wu and M.E. Moskowitz, "A CostEffective Test Data Compaction Scheme," Proc. IEEE Custom IC Conf., pp. 13.7.113.7.3, 1992.
[56] Y. Zorian and A. Ivanov, "Programmable Space Compaction for BIST," Proc. 1993 Int'l Symp. FaultTolerant Computing, pp. 340349, 1993.