A State-Machine Synthesizer -- SMS
- 1 January 1981
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 301-305
- https://doi.org/10.1109/dac.1981.1585367
Abstract
Much of the work in implementing a state machine involves tedious calculations that require no creativity. This report describes the development of a digital-circuit synthesis program that helps reduce the tedium. SMS accepts a high-level description of a state machine and returns equations for implementation that assume a sum-of-products next-state and output functions and that also assume JK or D flip-flops for memory.Keywords
This publication has 3 references indexed in Scilit:
- Multiple-Output Optimization with Mosaics of Boolean FunctionsIEEE Transactions on Computers, 1975
- The Concept of Term Exclusiveness and Its Effect on the Theory of Boolean FunctionsJournal of the ACM, 1975
- MINI: A Heuristic Approach for Logic MinimizationIBM Journal of Research and Development, 1974