The partitioning behavior of linear finite state machines and VLSI applications
| dc.contributor.author | Kontopidi, Evaggelia | en_US |
| dc.date.accessioned | 2024-08-14T18:33:42Z | |
| dc.date.available | 2024-08-14T18:33:42Z | |
| dc.date.copyright | 1992 | en_US |
| dc.date.issued | 1992 | |
| dc.degree.department | Department of Computer Science | |
| dc.degree.level | Master of Science M.Sc. | en |
| dc.description.abstract | Linear Feedback Shift Registers (LFSRs) and Linear Cellular Automata Registers (LCARs) are linear finite state machines which are used in built-in self test as test pattern generators and signature analyzers. We consider the problem of partitioning maximal length machines into a number of smaller maximal length submachines. Our research has shown that only a small percentage of all the primitive machines can be partitioned in such a way. Generally, LCARs have better partitioning behavior than LFSRs. It is suggested that almost all maximal length machines can be partitioned into bit slices which preserve the required property if we allow minimum modifications to the registers. The extra hardware required for partitioning and modifications is estimated using the OASIS Design System and the Magic Layout Editor. The experimental and theoretical results are presented and discussed as well as application areas of our research. | en |
| dc.format.extent | 145 pages | |
| dc.identifier.uri | https://hdl.handle.net/1828/18477 | |
| dc.rights | Available to the World Wide Web | en_US |
| dc.subject | UN SDG 12: Responsible Consumption and Production | en |
| dc.title | The partitioning behavior of linear finite state machines and VLSI applications | en_US |
| dc.type | Thesis | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- KONTOPIDI_Evaggelia_MSc_1992_528728.pdf
- Size:
- 29.67 MB
- Format:
- Adobe Portable Document Format