This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Cellular Automata-Based Recursive Pseudoexhaustive Test Pattern Generator
February 2001 (vol. 50 no. 2)
pp. 177-185

Abstract—This paper presents a recursive technique for generation of pseudoexhaustive test patterns. The scheme is optimal in the sense that the first $2^k$ vectors cover all adjacent k-bit spaces exhaustively. It requires substantially lesser hardware than the existing methods and utilizes the regular, modular, and cascadable structure of local neighborhood Cellular Automata (CA), which is ideally suited for VLSI implementation. In terms of XOR gates, this approach outperforms earlier methods by 15 to 50 percent. Moreover, test effectiveness and hardware requirements have been established analytically, rather than by simple simulation and logic minimization.

[1] E.J. McClusky, “Verification Testing—A Pseudoexhaustive Test Technique,” IEEE Trans. Computers, vol. 33, no. 6, pp. 541-546, June 1984.
[2] D. Tang and L. Woo, “Exhaustive Test Pattern Generation with Constant Weight Vector,” IEEE Trans. Computers, vol. 32, no. 12, pp. 1145-1150, Dec. 1983.
[3] L.T. Wang and E.J. McCluskey, “Condensed Linear Feedback Shift Register (LFSR) Testing—A Pseudoexhaustive Test Technique,” IEEE Trans. Computers, vol. 35, no. 4, pp. 367-370, Apr. 1986.
[4] D. Wang and C. Chen, “Logic Test Pattern Generation Using Linear Codes,” IEEE Trans. Computers, vol. 33, no. 9, pp. 845-850, Sept. 1984.
[5] L.T. Wang and E.J. McCluskey, “Circuits for Pseudoexhaustive Test Pattern Generation,” IEEE Trans. Computer-Aided Design, vol. 7, no. 10, pp. 1,068-1,080, Oct. 1988.
[6] D. Wang and C. Chen, “Iterative Exhaustive Pattern Generation for Logic Testing,” IBM J. Research Development, vol. 28, pp. 212-219, Mar. 1984.
[7] C.L. Chen, "Exhaustive Test Pattern Generation Using Cyclic Codes," IEEE Trans. Computers, vol. 37, no. 2, pp. 225-228, Feb. 1988.
[8] Z. Barzilai, D. Copersmith, and A. Rosenburg, “Exhaustive Generation of Bit Patterns with Application to VLSI Testing,” IEEE Trans. Computers, vol. 32, no. 2, pp. 190-194, Feb. 1983.
[9] A. Das and P.P. Chaudhuri, “Pseudo-Exhaustive Test Pattern Generation Using Cellular Automata,” IEEE Trans. Computers, Vol. 42, No. 3, Mar. 1993, pp. 340-352.
[10] J. Rajski and J. Tyszer, "Recursive Pseudo-Exhaustive Test Pattern Generation," IEEE Trans. Computers, vol. 42, no. 12, pp. 1,517-1,521, Dec. 1993.
[11] J.V. Neuman, The Theory of Self-Reproducing Automata, A.W. Burks, ed. Urbana, Ill. and London: Univ. of Illinois Press, 1966.
[12] S. Wolfram, “Statistical Mechanics of Cellular Automata,” Review of Modern Physics, vol. 55, pp. 601-644, July 1983.
[13] P.D. Hortensius et al., "Cellular Automata Based Pseudo-Random Number Generators for Built-In Self-Test," IEEE Trans. Computer-Aided Design, vol. 8, pp. 842-859, Aug. 1989.
[14] P.P. Chaudhuri, D.R. Chowdhury, S. Nandi, and S. Chattopadhyay, Additive Cellular Automata Theory and Applications: Volume 1. IEEE CS Press, 1997.
[15] P.D. Hortensius, H.C. Card, R.D. McLeod, and W. Pries, “Importance Sampling for Ising Computers Using One-Dimensional Cellular Automata,” IEEE Trans. Computers, vol. 38, no. 6, pp. 769-774, June 1989.
[16] P.D. Hortensius et al., “Cellular Automata Circuits for Built-In Self Test,” IBM J. Research and Development, vol. 34, March/May 1990.
[17] P.D. Hortensius, R.D. McLeod, and H.C. Card, "Cellular Automata Based Signature Analysis for Built-In Self-Test," IEEE Trans. Computers, vol. 39, no. 10, pp. 1,273-1,283, Oct. 1990.
[18] O. Martin, A.M. Odlyzko, and S. Wolfram, “Algebraic Properties of Cellular Automata,” Comm. Math. Physics, vol. 93, pp. 219-258, 1984.
[19] M. Serra et al., "The Analysis of One-Dimensional Linear Cellular Automata and Their Aliasing Properties," IEEE Trans. Computer-Aided Design, vol. 9, no. 7, pp. 767-778, July 1990.
[20] S. Nandi, B. Vamsi, S. Chakraborty, S. Roy, and P.P. Chaudhuri, “Delay Fault Test Generation with Cellular Automata,” Proc. Sixth Int'l Conf. VLSI Design, pp. 281-286, Jan. 1993.
[21] D. Roy Chowdhury, S. Basu, I. Sen Gupta, and P. Pal Chaudhuri, "Design of CAECC—Cellular Automata Based Error Correcting code," IEEE Trans. Computers, vol. 43, no. 6, pp. 759-764, June 1994.
[22] K. Sasidhar, S. Chattopadhyay, and P.P. Chaudhuri, “CAA Decoder for Cellular Automata Based Byte Error Correcting Code,” IEEE Trans. Computers, vol. 45, no. 9, pp. 1003-1016, Sept. 1996.
[23] S. Nandi, B.K. Kar, and P. Pal Chaudhuri, "Theory and Application of Cellular Automata in Cryptography," IEEE Trans. Computers, vol. 43, no. 12, pp. 1,346-1,357, Dec. 1994.
[24] D. Roy Chowdhury, S. Chakraborty, B. Vamsi, and P. Pal Chaudhuri, "Cellular Automata Based Synthesis of Easily and Fully Testable FSMs," Proc. ICCAD '93, pp. 650-653, Nov. 1993.

Index Terms:
Data path architecture, pseudoexhaustive testing, BIST, cellular automata.
Citation:
Prabir Dasgupta, Santanu Chattopadhyay, P. Pal Chaudhuri, Indranil Sengupta, "Cellular Automata-Based Recursive Pseudoexhaustive Test Pattern Generator," IEEE Transactions on Computers, vol. 50, no. 2, pp. 177-185, Feb. 2001, doi:10.1109/12.908993
Usage of this product signifies your acceptance of the Terms of Use.