Acharya, Smarak2017-08-252017-08-2520172017-08-25http://hdl.handle.net/1828/8455Pseudorandom 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.enAvailable to the World Wide WebCellular AutomataPseudorandomm-sequenceLinear ComplexityRandomnessBalanceRunAutocorrelation1D CA Evaluation SystemThesis