Abstract
Flow tables specifying large asynchronous sequential circuits often contain more internal states than are required to specify desired circuit behavior. Known minimization techniques appear unsuited for reduction of such large (rows X columns > 250) flow tables, because of excessive computation and intermediate data requirements for problems of this size. The algorithm described here is intended to rapidly produce a simplified-but in general non-minimal-flow table. It is most economical when applied to extremely large tables and was devised primarily for automated design applications. The procedure has been programmed in PL/1 and has been incorporated into an asynchronous sequential circuit design automation system developed at the University of Missouri-Rolla. Typical flow table simplification times obtained using the program are cited. In one test re-duction of a 217 row x 8 column table to 39x8 required about 2.6 minutes (the minimum table in this case was known to be 23x8).
Recommended Citation
R. J. Smith and J. H. Tracey, "A Simplification Heuristic For Large Flow Tables," Proceedings - Design Automation Conference, pp. 47 - 53, Association for Computing Machinery, Jun 1970.
The definitive version is available at https://doi.org/10.1145/800160.805111
Department(s)
Electrical and Computer Engineering
International Standard Serial Number (ISSN)
0738-100X
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2023 Association for Computing Machinery, All rights reserved.
Publication Date
22 Jun 1970
Comments
National Science Foundation, Grant GK 2017