MUSE: a multilevel symbolic encoding algorithm for state assignment
MUSE: a multilevel symbolic encoding algorithm for state assignment
复制标题
DOI：
10.1109/hicss.1990.205137
复制
发表时间：
1990-01
期刊：
影响因子：
--
通讯作者：
X. Du;G. Hachtel;Bill Lin;A. Newton
中科院分区：
文献类型：
--
作者：
X. Du;G. Hachtel;Bill Lin;A. Newton
提出了一种用于多级实现的有限状态机编码的状态分配算法--多重符号编码（MUSE）。状态对的权重的计算是基于1热编码状态机的多级表示。三种类型的状态对-或，复杂，和更多复杂-有限状态机的多级表示的上下文中定义的。因此，布尔运算和代数运算都用于计算状态对的权重。计算当前状态和下一个状态的权重矩阵的方法。使用三个对权重来计算当前状态项，并且使用类似MIS的公共立方体提取技术来估计每个下一状态对之间的编码亲和力。
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.>