Shape-based sequential machine analysis

Author

Crews, Andrew ; Brewer, Forrest

Author_Institution

California Univ., Santa Barbara, CA, USA

Volume

1

fYear

1999

fDate

36342

Firstpage

395

Abstract

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

Keywords

computational complexity; encoding; finite state machines; logic design; sequential machines; timing; FSM; automata; bit-level encoding complexity; correct output behavior; predefined communication complexity; sequential specification; shape constraints; shape-based sequential machine analysis; Automata; Circuit topology; Communication system control; Costs; Delay; Encoding; Feedback; Logic; Shape; Signal design;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1999. ISCAS '99. Proceedings of the 1999 IEEE International Symposium on

Conference_Location

Orlando, FL

Print_ISBN

0-7803-5471-0

Type

conf

DOI

10.1109/ISCAS.1999.777887

Filename

777887