Optimizing interacting finite state machines using sequential don't cares
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 10 (12) , 1473-1484
- https://doi.org/10.1109/43.103497
Abstract
Approaches are presented to multilevel sequential logic synthesis-algorithms and techniques for the area and performance optimizations of interconnected finite state machine descriptions. Techniques are presented for the exploitation of sequential don't cares in arbitrary, interconnected sequential machine structures. Exploiting these don't care sequences can results in significant improvements in area and performance. The problem of moving logic across state machine boundaries so as to make particular machines less complex at the possible expense of making others more complex is addressed. Optimization algorithms that incrementally modify state machine structures across latch boundaries are also presented. The use of more global state machine decomposition and factorization algorithms for area optimization is described, and experimental results using these algorithms on sequential circuits are presentedKeywords
This publication has 9 references indexed in Scilit:
- Decomposition and factorization of sequential finite state machinesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- MUSTANG: state assignment of finite state machines targeting multilevel logic implementationsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- MIS: A Multiple-Level Logic Optimization SystemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Symbolic Design of Combinational and Sequential Logic Circuits Implemented by Two-Level Logic MacrosIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1986
- Optimal State Assignment for Finite State MachinesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
- The Simplification of Sequential Machines with Input RestrictionsIEEE Transactions on Computers, 1972
- A Programmed Algorithm for Assigning Internal Codes to Sequential MachinesIEEE Transactions on Electronic Computers, 1962
- The Cascade Decomposition of Sequential MachinesIEEE Transactions on Electronic Computers, 1961
- Minimizing the Number of States in Incompletely Specified Sequential Switching FunctionsIEEE Transactions on Electronic Computers, 1959