Don´t care sequences and the optimization of interacting finite state machines

Author

Rho, June-Kyung ; Somenzi, Fabio

Author_Institution

Dept. of Electr. & Comput. Eng., Colorado Univ., Boulder, CO, USA

Volume

13

Issue

7

fYear

1994

fDate

7/1/1994 12:00:00 AM

Firstpage

865

Lastpage

874

Abstract

We explore the nature of incomplete specification in sequential circuits. We compare it to the case of combinational circuits and propose new definitions and algorithms. We extend the existing algorithms for input don´t care sequences and provide a new theory for output don´t care sequences, based on the concept of information lossyness. The implementation of the proposed techniques in a program called SEQUOIA (sequential optimization of interacting automata) shows that our approach is viable and effective

Keywords

finite automata; finite state machines; logic CAD; optimisation; sequential circuits; SEQUOIA; algorithms; circuit design; combinational circuits; incomplete specification; information lossyness; input don´t care sequences; interacting finite state machines; optimization; output don´t care sequences; sequential circuits; sequential optimization of interacting automata; Artificial intelligence; Automata; Automatic control; Combinational circuits; Controllability; Delay; Design optimization; Multivalued logic; Observability; Sequential circuits;

fLanguage

English

Journal_Title

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

Publisher

ieee

ISSN

0278-0070

Type

jour

DOI

10.1109/43.293943

Filename

293943