Shape-based sequential machine analysis

In this paper, the problem of determining if a given sequential specification can be made to fit a predetermined set of shape constraints is explored. Shape constraints are constraints not on the logical makeup of the automata, but on the distribution of information required to support correct output behavior. These constraints allow the machine to be distributed into partitions with predefined communication and bit-level encoding complexity. For example, construction of a machine in the form of a feedback shift-register is a simple case of a shape constraint. Such constraints are based on the notion of a "D-atom" which is somewhat similar to dichotomy based encoding.

• Type: Conference
• Year: 1999
• Where: ISCAS
• Authors: A. Crews, F. Brewer
• Keywords: Bit-level Encoding Complexity, Correct Output Behavior, Hardware, ISCAS 1999, Shape Constraint