MUSE: a multilevel symbolic encoding algorithm for state assignment

Author

Du, Xuejun ; Hachtel, Gary ; Moceyunas, Peter

Author_Institution

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

Volume

i

fYear

1990

fDate

2-5 Jan 1990

Firstpage

367

Abstract

A state assignment algorithm called multiple symbolic encoding (MUSE) is presented for the encoding of finite state machines targeted for multilevel implementation. The computation of weights of state pairs is based on a multilevel representation of the 1-hot encoded state machine. Three types of state pairs-OR, COMPLEX, and MORE-COMPLEX-are defined in the context of multilevel representations of finite state machines. Thus, both Boolean and algebraic operations are used to calculate the weights of state pairs. Methods for computing present-state and next-state weight matrices are presented. The three pair weights are used to compute the present state terms, and MIS-like common cube extraction techniques are used to estimate the encoding affinity between each next-state pair

Keywords

encoding; finite automata; logic CAD; Boolean operations; MIS-like common cube extraction; MUSE; algebraic operations; multilevel implementation; multilevel symbolic encoding algorithm; next-state weight matrices; state assignment; Application specific integrated circuits; Arithmetic; Automata; Chip scale packaging; Encoding; Hardware; Logic design; State estimation;

fLanguage

English

Publisher

ieee

Conference_Titel

System Sciences, 1990., Proceedings of the Twenty-Third Annual Hawaii International Conference on

Conference_Location

Kailua-Kona, HI

Type

conf

DOI

10.1109/HICSS.1990.205137

Filename

205137