Two dimensional cellular automata and pseudorandom sequence generation
| dc.contributor.author | Sh, Umer Khayyam | |
| dc.contributor.supervisor | Gulliver, T. Aaron | |
| dc.date.accessioned | 2019-11-14T00:57:56Z | |
| dc.date.available | 2019-11-14T00:57:56Z | |
| dc.date.copyright | 2019 | en_US |
| dc.date.issued | 2019-11-13 | |
| dc.degree.department | Department of Electrical and Computer Engineering | |
| dc.degree.level | Master of Applied Science M.A.Sc. | en_US |
| dc.description.abstract | Maximum linear feedback shift registers (LFSRs) based on primitive polynomials are commonly used to generate maximum length sequences (m-sequences). 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 CAs. | en_US |
| dc.description.scholarlevel | Graduate | en_US |
| dc.identifier.uri | http://hdl.handle.net/1828/11317 | |
| dc.language | English | eng |
| dc.language.iso | en | en_US |
| dc.rights | Available to the World Wide Web | en_US |
| dc.subject | cellular automata | en_US |
| dc.subject | 2D CA | en_US |
| dc.subject | pseudorandom sequence | en_US |
| dc.subject | random sequence | en_US |
| dc.subject | m-sequence | en_US |
| dc.title | Two dimensional cellular automata and pseudorandom sequence generation | en_US |
| dc.type | Thesis | en_US |