Event Details
Two Dimensional Cellular Automata and Pseudorandom Sequence Generation
Presenter: Umer Khayyam Sh
Supervisor:
Date: Wed, November 6, 2019
Time: 15:00:00 - 16:00:00
Place: EOW 230
ABSTRACT
Abstract
Maximum linear feedback shift registers (LFSR) based on primitive polynomials are commonly used to generate maximum length sequences (m-sequence). An m-sequence is a pseudorandom sequence that exhibits ideal randomness properties like balance, run and autocorrelation but has low linear complexity. One-dimensional Cellular Automata (1D CA) have been used to generate m-sequences and pseudorandom sequences that have high linear complexity and good randomness. This thesis considers the use of two-dimensional Cellular Automata (2D CA) to generate m-sequences and psuedorandom sequences that have high linear complexity and good randomness. The properties of these sequences are compared with those of the corresponding m-sequences and the best sequences generated by 1D CA.