A fast algorithm for the optimal state assignment of large finite state machines

[1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers Pub Date : 1988-11-07 DOI:10.1109/ICCAD.1988.122483

D. Varma, E. Trachtenberg

引用次数: 22

Abstract

A state-assignment procedure is presented that uses only abstract complexity criteria and produces assignments that are not targeted toward particular implementations. It produces networks similar in complexity to those obtained by contemporary methods but is an order of magnitude faster, because it does not use computationally expensive logic synthesis algorithms to predict the effect of assignment on synthesis. Assignments for finite-state machines typically took about 10 minutes on a VAX 11/780.<>

查看原文本刊更多论文

大型有限状态机最优状态分配的快速算法

提出了一种状态分配过程，它只使用抽象的复杂性标准，并产生不针对特定实现的分配。它产生的网络在复杂性上与当代方法获得的网络相似，但速度要快一个数量级，因为它不使用计算代价高昂的逻辑合成算法来预测分配对合成的影响。在VAX 11/780上，有限状态机的分配通常需要大约10分钟。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

[1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers

自引率

0.00%

发文量