This paper discusses the symbolic functional decoposition method for implementing finite state machines infield-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 β{sub}G and β{sub}(Qv) blankets is introduced, along with results showing the advantages of this method in comparison to the current state-of-the-art solutions. DOI^10.1109/ICSEng.2008.66
展开▼
机译：本文讨论了实现有限状态机器可编程栅极阵列设备的符号功能的作用术语方法作为目前广泛的两步方法的可行替代方法，该问题包括单独的编码和映射阶段。而且，引入了一种用于获得β{Sub} G和β{Sub}（QV）毯的新算法，以及显示该方法的优点与当前的最先进的解决方案相比。 DOI ^ 10.1109 / icseng.2008.66
展开▼
