The Analysis of One-Dimensional Linear Cellular Automata and Their Aliasing Properties

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 9, Issue 7, 1990, Pages 767-778

  Serra, Micaela ^a   Slater, Terry ^a   Muzio, Jon C ^a   Miller, D Michael ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Applied linear algebra; automata theory; cellular automata (CA); linear feedback shift registers (LFSR's); pseudorandom pattern generators; signature analysis; testing; VLSI

Indexed keywords

INTEGRATED CIRCUITS, VLSI--ANALYSIS;

CELLULAR AUTOMATA; LINEAR FEEDBACK SHIFT REGISTERS (LFSRS); SIGNATURE ANALYZERS;

AUTOMATA THEORY;

EID: 0025462762     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.55213     Document Type: Article

References (22)

1. P. H. Bardell, W. H. McAnney, and J. Savir, Built-in Test for VLSI. New York: Wiley, 1987.
2. G. Birkhoff and S. MacLane, A Survey of Modern Algebra. New York: MacMillan, 1965.
3. M. Damiani, P. Olivo, M. Favalli, S. Ercolani, and B. Ricco, “Aliasing in signature analysis testing with multiple-input shift-registers,” in Proc. European Test Conf., April 1989, pp. 346–353.
4. B. Elspas, “The theory of autonomous linear sequential networks,” IRE Trans. Circuit Theory, vol. CT-6, pp. 45–60, 1959.
5. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge, U.K.: Cambridge University, 1985.
6. P. D. Hortensius, H. C. Card, and R. D. McLeod, “Parallel random number generation for VLSI using cellular automata,” IEEE Trans. Comput., vol. 38, pp. 1466–1473, Oct. 1989.
7. P. D. Hortensius and R. D. McLeod, “Cellular automata-based signature analysis for built-in self-test,” presented at 3rd Technical Workshop— New Directions for IC Testing, Oct. 1988.
8. A. Ivanov and V. K. Agarwal, “An iterative technique for calculating aliasing probability of linear feedback signature registers,” in Proc. Int. Symp. Fault Tolerant Computing, June 1988, pp. 70–75.
9. W. H. Kautz, ed. Linear Sequential Switching Circuits. San Francisco, CA: Holden-Day, 1965.
10. D. E. Knuth, The Art of Computer Programming: Seminumerical Algorithms, volume 2. Reading, MA: Addison-Wesley, 1981.
11. S. Lipschutz, Linear Algebra. New York: McGraw-Hill, 1968.
12. W. Wesley Peterson and E. J. Weldon, Error-Correcting Codes. Cambridge, MA: MIT, 1972.
13. J. Ponstein, “Self-avoiding paths and the adjacency matrix of a graph,” SIAMJ. Appl. Math., vol. 14, pp. 600–609, 1966.
14. W. Pries, A. Thanailakis, and H. C. Card, “Group properties of cellular automata and VLSI applications,” IEEE Trans. Comput., vol. C-35, pp. 1013–1024, Dec. 1986.
15. M. Serra and T. Slater, “A Lanczos algorithm in a finite field and its application,” to be published in JCMCC, 1990.
16. T. Slater and M. Serra, “Tables of linear hybrid 90/150 cellular automata,” Tech. Rep. DCS-105-IR, Univ. Victoria, Dep. Comput. Sci., Univ. of Victoria, Victoria, B.C., Jan. 1989.
17. J. E. Smith, “Measures of effectiveness of fault signature analysis,” IEEE Trans. Comput., vol. C-29, pp. 510–514, June 1980.
18. H. S. Stone, Discrete Mathematical Structures and Their Applications. New York: Science Research Associates, 1973.
19. T. W. Williams, W. Daehn, M. Gruetzner, and C. W. Starke, “Bounds and analysis of aliasing errors in linear feedback shift registers,” IEEE Trans. Computer Aided Design, pp. 75–83, Jan. 1988.
20. S. Wolfram, “Statistical mechanics of cellular automata,” Rev. Modern Phys., vol. 55, pp. 601–644, 1983.
21. —, “University and complexity in cellular automata,” Physica, vol. 10D, pp. 1–35, 1984.
22. N. Zierler, “Linear recurring sequences,” J. SI AM, vol. 7, no. 1, pp. 31–48, 1959.