IEEE Transactions on Computers
Symbolic two-dimensional minimization of strongly unspecified finite state machines
Journal of Systems Architecture: the EUROMICRO Journal
Local Encoding Transformations for Optimizing OBDD-Representations of Finite State Machines
Formal Methods in System Design
Logic Minimization Algorithms for VLSI Synthesis
Logic Minimization Algorithms for VLSI Synthesis
Decomposition of Finite State Machines for Area, Delay Minimization
ICCD '99 Proceedings of the 1999 IEEE International Conference on Computer Design
DSD '01 Proceedings of the Euromicro Symposium on Digital Systems Design
IEEE Transactions on Parallel and Distributed Systems
An application of functional decomposition in ROM-based FSM implementation in FPGA devices
Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Reconfigurable embedded systems: Synthesis, design and application
Minimization of incompletely specified mealy finite-state machines by merging two internal states
Journal of Computer and Systems Sciences International
Sequential algorithm for low-power encoding internal states of finite state machines
Journal of Computer and Systems Sciences International
| Hi-index | 0.00 |
The problem of minimization of Moore finite-state machines (FSMs) is considered. This problem often arises in designing digital devices based on programmable logic devices. The proposed approach uses the operation of merging of two states of an FSM and the representation of the FSM as a list of transitions. Conditions guaranteeing the identical operation and deterministic behavior of the transformed FSM obtained by merging two states are given. The cases when wait states can emerge are also discussed. Algorithms for minimizing the number of internal states, transition paths, and the number input variables of Moore FSMs are described. Experimental results have shown that the proposed approach reduces the number of internal states by 6% on the average and sometimes by a factor of 1.86; the number of transitions is reduced by 20% on the average and sometimes by a factor of 2.83. The use of the proposed method in combination with the STAMINA computer program reduces the number of internal states by 16% on the average and sometimes by a factor of 2.17; the number of transitions is reduced by 41% on the average and sometimes by a factor of 7.97. In conclusion, important directions of research concerning the minimization of FSMs are discussed.