The partitioning behavior of linear finite state machines and VLSI applications
Date
1992
Authors
Kontopidi, Evaggelia
Journal Title
Journal ISSN
Volume Title
Publisher
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.
Description
Keywords
UN SDG 12: Responsible Consumption and Production