MUSE: a multilevel symbolic encoding algorithm for state assignment

Author

Du, Xin ; Hachtel, Gary ; Lin, Bill ; Newton, A. Richard

Author_Institution

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

Volume

10

Issue

1

fYear

1991

fDate

1/1/1991 12:00:00 AM

Firstpage

28

Lastpage

38

Abstract

A novel state assignment algorithm, called MUSE (multilevel symbolic encoding), for the encoding of FSMs (finite state machines) targeted for multilevel implementation is presented. Novel methods are discussed for the computation of state pair costs that are based onmultilevel algebraic structures derived from the one hot encoded state machine by purely algebraic techniques. Both Boolean (distance-1 MERGE and consensus) and algebraic (SUB-EXPRESSION EXTRACTION and CO-KERNEL EXTRACTION) operations are used to calculate the encoding affinity of state pairs, and account for face embedding constraints as well. Both heuristic and simulated annealing encoding techniques are used

Keywords

Boolean algebra; encoding; finite automata; Boolean operations; MUSE; encoding affinity; face embedding constraints; finite state machines; heuristic encoding; hot encoded state machine; multilevel algebraic structures; multilevel symbolic encoding algorithm; simulated annealing encoding; state assignment; state pair costs; Automata; Computer science; Costs; Design automation; Encoding; Minimization methods; Programmable logic arrays; Simulated annealing; State estimation;

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.62789

Filename

62789