Simple cellular automata as pseudorandom m -sequence generators for built-in self-test

DOI10.1145/272991.273007zbMath0918.65004MaRDI QIDQ4228542

Makoto Matsumoto

Publication date: 31 May 1999

Published in: ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/272991.273007

zbMATH Keywords

cellular automata; finite fields; VLSI; pseudorandom number generation; random number generation; \(m\)-sequence

Mathematics Subject Classification ID

94A55: Shift register sequences and sequences over finite alphabets in information and communication theory

68Q80: Cellular automata (computational aspects)

65C10: Random number generation in numerical analysis

11K45: Pseudo-random numbers; Monte Carlo methods

Related Items

INCREMENTAL EVOLUTION OF CELLULAR AUTOMATA FOR RANDOM NUMBER GENERATION, OPTIMIZATION OF 2D LATTICE CELLULAR AUTOMATA FOR PSEUDORANDOM NUMBER GENERATION