51³Ô¹Ï

This website stores cookies on your computer. These cookies are used to collect information about how you interact with our website and allow us to remember your browser. We use this information to improve and customize your browsing experience, for analytics and metrics about our visitors both on this website and other media, and for marketing purposes. By using this website, you accept and agree to be bound by UVic’s Terms of Use and Protection of Privacy Policy. If you do not agree to the above, you must not use this website.

Skip to main content
People Departments Maps Buildings Rooms A-Z
University
of 51³Ô¹Ï
51³Ô¹Ï Library
Sign in Online tools Sign out
Faculty of Graduate Studies

Nafeesa Sheikh

  • BSc (University of Fatima Jinnah, 2021)
Notice of the Final Oral Examination for the Degree of Master of Applied Science

Topic

One-Dimensional Cellular Automata and Shrinking Generators for Pseudorandom Sequence Generation

Department of Electrical and Computer Engineering

Date & location

  • Wednesday, July 16, 2025

  • 10:00 A.M.

  • Virtual Defence

Reviewers

Supervisory Committee

  • Dr. T. Aaron Gulliver, Department of Electrical and Computer Engineering, UVic (Supervisor)

  • Dr. Fayez Gebali, Department of Electrical and Computer Engineering, UVic (Member) 

External Examiner

  • Dr. Sudhakar Ganti, Department of Computer Science, 51³Ô¹Ï 

Chair of Oral Examination

  • Dr. Scott McIndoe, Department of Chemistry, UVic 

Abstract

Linear feedback shift registers (LFSRs) based on primitive polynomials are commonly used to generate maximum length sequences (m-sequences). These pseudorandom sequences demonstrate desirable randomness properties such as balance, run, and autocorrelation while exhibiting low linear complexity. One-dimensional Cellular Automata (CA) have been employed to produce m-sequences and pseudorandom sequences with high linear complexity and strong randomness characteristics. This thesis explores the application of one-dimensional CA with the shrinking generator approach to obtain sequences with high linear complexity and good randomness. An analysis of the properties of these sequences in relation to the corresponding m sequences is given. Three types of shrinking generators are considered in this thesis.

Back to oral exams