Simple cellular automata as pseudorandom m -sequence generators for built-in self-test
DOI10.1145/272991.273007zbMath0918.65004OpenAlexW1988348445MaRDI QIDQ4228542
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
cellular automatafinite fieldsVLSIpseudorandom number generationrandom number generation\(m\)-sequence
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cellular automata (computational aspects) (68Q80) Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (5)
This page was built for publication: Simple cellular automata as pseudorandom m -sequence generators for built-in self-test