Cellular automata pseudorandom sequence generation
Date
2017-08-25
Authors
Acharya, Smarak
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Pseudorandom sequences have many applications in fields such as wireless communication, cryptography and built-in self test of integrated circuits. Maximal length
sequences (m-sequences) are commonly employed pseudorandom sequences because
they have ideal randomness properties like balance, run and autocorrelation. However, the linear complexity of m-sequences is poor. This thesis considers the use of
one-dimensional Cellular Automata (CA) to generate pseudorandom sequences that
have high linear complexity and good randomness. The properties of these sequences
are compared with those of the corresponding m-sequences to determine their suitability.
Description
Keywords
Cellular Automata, Pseudorandom, m-sequence, Linear Complexity, Randomness, Balance, Run, Autocorrelation, 1D CA Evaluation System