Skip to main content
SpringerLink
Log in

A class of two-dimensional cellular automata and their applications in random pattern testing

  • Built-In Self-Test
  • Published:
Journal of Electronic Testing Aims and scope Submit manuscript

Abstract

A basic framework to characterize the behavior of two-dimensional (2-D) cellular automata (CA) has been proposed. The performance of the regular structure of the 2-D CA has been evaluated for pseudo-random pattern generation. The potential increase in the local neighborhood structure for 2-D CA has led to better randomness of the generated patterns as compared to LFSR and 1-D CA. The quality of the random patterns generated with 2-D CA based built-in-self-test (BIST) structure has been evaluated by comparing the fault coverage on several benchmark circuits. Also a method of synthesizing 2-D CAs to generate patterns of specified length has been reported. The patterns generated can serve as a very good source of random two-dimensional sequences and also variable length parallel pattern generation having virtually nil correlation among the bit patterns.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Knuth,Seminumerical Algorithms, Addison-Wesley, Reading, MA, 1981.

    Google Scholar 

  2. P. Bardell and W. McAnney, “Pseudo-random arrays for built-in tests,”IEEE Trans. on Computers, vol. 35, pp. 653–658, July 1986.

    Google Scholar 

  3. P.D. Hortensius et al., “Cellular automata based pseudo-random number generators for built-in self-test,”IEEE Trans. on CAD, vol. 8, pp. 842–859, Aug. 1989.

    Google Scholar 

  4. P.D. Hortensius et al., “Cellular automata circuits for built-in self test,”IBM J. Res. & Dev., vol. 34, March/May 1990.

  5. P.D. Hortensius, R.D. McLeod, and H.C. Card, “Parallel pseudo-random number generation for VLSI systems using cellular automata,”IEEE Trans. on Computers, vol. 38, pp. 1466–1473, Oct. 1989.

    Google Scholar 

  6. P. Bardell, “Analysis of cellular automata used as pseudo-random pattern generators,”Proc. Intl. Test Conf., pp. 762–768, 1990.

  7. A. Das, A. Sanyal, and P.P. Chaudhuri, “On the characterization of Cellular Automata,”Information Science, vol. 65, pp. 251–267, June 1992.

    Google Scholar 

  8. T. Toffoli and N. Margolus,Cellular Automata Machines, MIT Press, Cambridge, MA, 1987.

    Google Scholar 

  9. S. Wolfram, “Random sequence generation by cellular automata,”Advances in Applied Mathematics, pp. 123–169, July 1986.

  10. A. Das and P.P. Chaudhuri, “Pseudo-exhaustive test pattern generation using cellular automata,”IEEE Trans. on Computes, vol. 42, pp. 340–352, March 1993.

    Google Scholar 

  11. D.R. Chowdhury, P. Subbarao, and P.P. Chaudhuri, “Characterization of two dimensional cellular automata using matrix algebra,”Information Sciences. To appear.

  12. F.R. Gantmatcher,The Theory of Matrices, vol. 1, Chelsea Publishing Co., NY, 1959.

    Google Scholar 

  13. M. Harwit, “Spectrometric images,”Applied Optics, vol. 12, pp. 285–288, December 1973.

    Google Scholar 

  14. J. Lindner, “Binary sequences up to length 40 with best possible autocorrelation function,”Electronic Letters, vol. 11, p. 507, Nov. 1975.

    Google Scholar 

  15. F. MacWilliams and N. Sloane, “Pseudo-random sequences and arrays,”Proc. IEEE, vol. 64, pp. 1715–1729, Dec. 1976.

    Google Scholar 

  16. M. Schroder, “Sound diffusion by maximum length sequences,”J. Acoustics Soc. Am., vol. 57, pp. 149–150, 1975.

    Google Scholar 

  17. P. Bardell, W. McAnney, and J. Savir,Built-in Test for VLSI: Pseudo-Random Techniques, John Wiley & Sons, NY, NY, 1987.

    Google Scholar 

  18. A.K. Das, D. Saha, S. Misra, and P. Pal Chaudhuri, “Signature analyzer based on additive cellular automata,”Proc. 20th Fault Tolerant Computing Symp., pp. 265–272, June 1990.

  19. P.D. Hortensius, R.D. McLeod, and H.C. Card, “Cellular automata based signature analysis for built-in self-test,”IEEE Trans. on Computers, vol. 39, pp. 1273–1283, Oct. 1990.

    Google Scholar 

  20. M. Serra, T. Slater, J.C. Muzio, and D.M. Miller, “Analysis of one-dimensional cellular automata and their aliasing probabilities,”IEEE Trans. on CAD, vol. 9, pp. 767–777, July 1990.

    Google Scholar 

  21. F. Brglez and H. Fujiwara, “A neutral netlist of 10 combinational benchmark circuits,”Proc. IEEE Intl. Symp. Circuits & Systems, Kyoto, pp. 663–698, 1985.

  22. N. Packard and S. Wolfram, “Two dimensional cellular automata,”J. Stat. Phys., vol. 38, p. 901, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science & Engineering, Indian Institute of Technology, 721 302, Kharagpur, India

    D. Roy Chowdhury, I. Sengupta & P. Pal Chaudhuri

Authors
  1. D. Roy Chowdhury
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. Sengupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. Pal Chaudhuri
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chowdhury, D.R., Sengupta, I. & Chaudhuri, P.P. A class of two-dimensional cellular automata and their applications in random pattern testing. J Electron Test 5, 67–82 (1994). https://doi.org/10.1007/BF00971964

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00971964

Keywords

Search

Navigation