Code sharing in FPGA-based Moore FSMs

A method of hardware reduction is proposed for logic circuits of Moore FSMs implemented with FPGAs. The method is based on the idea of code sharing. The main difference from already known methods is that the counter increases its content during conditional and unconditional transitions. An example of application of proposed method is given.

[1]  A. A. Barkalov.  Principles of logic optimization for a moore microprogrammed automaton , 1998 .

[2]  Marian Adamski,et al.  Application of comparability graphs in decomposition of Petri nets , 2014, 2014 7th International Conference on Human System Interactions (HSI).

[3]  Wolfgang A. Halang,et al.  Design of microprogrammed controllers to be implemented in FPGAs , 2011, Int. J. Appl. Math. Comput. Sci..

[4]  B. Eschermann,et al.  PLA based finite state machines using Johnson counters as state memories , 1988, Proceedings 1988 IEEE International Conference on Computer Design: VLSI.

[5]  Alexander Barkalov,et al.  Design of FPGA-Based Moore FMSs with Counters , 2013, PDeS.

[6]  Utz G. Baitinger,et al.  Optimal state chains and state codes in finite state machines , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..