Return to search

Cellular automata pseudorandom sequence generation

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. / Graduate

Identiferoai:union.ndltd.org:uvic.ca/oai:dspace.library.uvic.ca:1828/8455
Date25 August 2017
CreatorsAcharya, Smarak
ContributorsGulliver, T. Aaron
Source SetsUniversity of Victoria
LanguageEnglish, English
Detected LanguageEnglish
TypeThesis
Formatapplication/pdf
RightsAvailable to the World Wide Web

Page generated in 0.0025 seconds