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
| Identifer | oai:union.ndltd.org:uvic.ca/oai:dspace.library.uvic.ca:1828/8455 |
| Date | 25 August 2017 |
| Creators | Acharya, Smarak |
| Contributors | Gulliver, T. Aaron |
| Source Sets | University of Victoria |
| Language | English, English |
| Detected Language | English |
| Type | Thesis |
| Format | application/pdf |
| Rights | Available to the World Wide Web |
Page generated in 0.0022 seconds