An Explicit Similarity Transform between Cellular Automata and LFSR Matrices

Finite Fields and their Applications

Volumn 4, Issue 3, 1998, Pages 239-251

  Cattell, Kevin ^a   Muzio, Jon C ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0009025409     PISSN: 10715797     EISSN: None     Source Type: Journal    
DOI: 10.1006/ffta.1998.0212     Document Type: Article

References (10)

1. P. H. Bardell, Analysis of cellular automata used as pseudorandom pattern generators, in, Proceedings of IEEE International Test Conference, 1990, 762, 767.
2. Cattell K., Muzio J. C. Synthesis of one-dimensional linear hybrid cellular mautomata. IEEE Trans Computer-Aided Design. 15:1996;325-335.
3. Das A. K., Ganguly A., Dasgupta A., Bhawmik S., Chaudhuri P. P. Efficient characterisation of cellular automata. IEE Proc. E Comput. Digital Tech. 137:1990;81-87.
4. Hortensius P. D., McLeod R. D., Card H. C. Cellular automata-based signature analysis for built-in self-test. IEEE Trans. Comput. 39:1990;1273-1283.
5. Jungnickel D. Finite Fields: Structures and Arithmetics. 1993;B. I. Wissenschaftsverlag, Mannheim.
6. Lidl R., Niederreiter H. Introduction to Finite Fields and their Applications. 1986;Cambridge Univ. Press, Cambridge.
7. Serra M., Slater T., Muzio J. C., Miller D. M. The analysis of one dimensional linear cellular automata and their aliasing properties. IEEE Trans. Computer-Aided Design. 9:1990;767-778.
8. Stone H. S. Discrete Mathematical Structures and Their Applications. 1973;Sci. Res. Assoc. Chicago.
9. Shu T., Fushimi M. A method of designing cellular automata as pseudo-random number generators for built-in self-test for VLSI. Contemp. Math. 168:1994;363-367.
10. Wolfram S. Random sequence generation by cellular automata. Adv. in Appl. Math. 7:1986;123-169.