Simple Cellular Automata as Pseudorandom m-Sequence Generators for Built-In Self-Test

ACM Transactions on Modeling and Computer Simulation

Volumn 8, Issue 1, 1998, Pages 31-42

  Matsumoto, Makoto ^a,b  

^a KEIO UNIVERSITY   (Japan)

^b MAX PLANCK INSTITUT FÜR MATHEMATIK   (Germany)

Author keywords

Cellular automata; Finite fields; M sequence; Pseudorandom number generation; VLSI

Indexed keywords

CELLULAR AUTOMATA (CA); FINITE FIELDS;

ALGORITHMS; COMPUTER SIMULATION; FINITE AUTOMATA; INTEGER PROGRAMMING; INTEGRATED CIRCUIT LAYOUT; LINEAR ALGEBRA; MICROPROCESSOR CHIPS; PATTERN RECOGNITION SYSTEMS; POLYNOMIALS; RANDOM PROCESSES; VLSI CIRCUITS; CELLULAR ARRAYS; SELF TUNING CONTROL SYSTEMS;

RANDOM NUMBER GENERATION;

CELLULAR AUTOMATA; PSEUDORANDOM NUMBER GENERATION;

EID: 0031599401     PISSN: 10493301     EISSN: None     Source Type: Journal    
DOI: 10.1145/272991.273007     Document Type: Conference Paper

References (14)

1. BARDELL, P. 1990. Analysis of cellular automata used as pseudorandom pattern generators. In Proceedings of the IEEE 21st International Test Conference (Washington D.C., Sept. 1990), 762-768.
2. n ± 1 (2nd ed.), Contemporary Mathematics, Vol. 22, AMS, Providence, RI.
3. CALDWELL, C. 1997. The prime page. http://www.utm.edu:80/research/primes/mersenne.shtml.
4. HERINGA, J., BLÖTE, H., AND COMPAGNER, A. 1992. New primitive trinomials of Mersenne-exponent degrees for random-number generation. Int. J. Modern Physics C 3, 561-564.
5. HOOLEY, C. 1967. Artin's conjecture for primitive roots. J. Reine. Angew. Math. 225, 209-220.
6. HORTENSIUS, P., McLEOD, R. D., AND CARD, H. C. 1989. Parallel random number generation for VLSI systems using cellular automata. IEEE Trans. Comput. 38, 1467-1472.
7. HORTENSIUS, P., McLEOD, R. D., PRIES, W., MILLER, D. M., AND CARD, H. C. 1989. Cellular automata-based pseudorandom number generators for built-in self-test. IEEE Trans. Comput.-Aided Des. Integ. Circuits Syst. 8, 842-859.
8. KURITA, Y. AND MATSUMOTO, M. 1991. Primitive t-nomials (t = 3, 5) over GF(2) whose degree is a Mersenne exponent ≤44497. Math. Comput. 56, 817-821.
9. MARTIN, O., ODLYZKO, A., AND WOLFRAM, S. 1984. Algebraic properties of cellular automata. Commun. Math. Phys. 93, 219-258.
10. SERRE, J. 1973. A Course in Arithmetic. GTM, Vol. 7, Springer-Verlag, New York.
11. TEZUKA, S. AND FUSHIMI, M. 1994. A method of designing cellular automata as pseudorandom number generators for built-in self-test for VLSI. Finite fields: theory, applications, and algorithms, Contemp. Math. 168, 363-367.
12. VON NEUMANN, J. 1966. Theory of Self-Reproducing Automata. A. W. Burks, Ed., Univ. of Illinois Press, Champaign, IL.
13. WOLFRAM, S. 1983. Statistical mechanics of cellular automata. Rev. Mod. Phys. 55, 601-644.
14. YARMOLIK, V. AND MURASHKO, I. 1993. Pseudo random sequence generator construction using cellular automata. Autom. Control Comput. Sci. 27, 9-13.