A Graph-Based Approach to Symbolic Functional Decomposition of Finite State Machines

This paper discusses the symbolic functional decomposition method for implementing finite state machines in field-programmable gate array devices as a viable alternative to the presently widespread two-step approach to the problem, which consist of separate encoding and mapping stages. Also, a new algorithm for obtaining the beta
_G
and beta
_Qv
blankets is introduced, along with results showing the advantages of this method in comparison to the current state-of-the-art solutions.